./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh --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 83223bd52506e4247e7ac7ce7a49284be0292b773b9e827e6221f58042ba0602 --- 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-2329fc7 [2022-12-14 11:58:45,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:58:45,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:58:45,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:58:45,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:58:45,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:58:45,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:58:45,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:58:45,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:58:45,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:58:45,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:58:45,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:58:45,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:58:45,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:58:45,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:58:45,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:58:45,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:58:45,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:58:45,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:58:45,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:58:45,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:58:45,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:58:45,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:58:45,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:58:45,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:58:45,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:58:45,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:58:45,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:58:45,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:58:45,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:58:45,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:58:45,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:58:45,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:58:45,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:58:45,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:58:45,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:58:45,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:58:45,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:58:45,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:58:45,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:58:45,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:58:45,274 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 11:58:45,287 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:58:45,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:58:45,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:58:45,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:58:45,288 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:58:45,288 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:58:45,288 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:58:45,289 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:58:45,289 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:58:45,303 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:58:45,303 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:58:45,303 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:58:45,303 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:58:45,303 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:58:45,304 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:58:45,304 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:58:45,304 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:58:45,304 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:58:45,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:58:45,305 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:58:45,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:58:45,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:58:45,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:58:45,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:58:45,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:58:45,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:58:45,306 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:58:45,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:58:45,306 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:58:45,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:58:45,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:58:45,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:58:45,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:58:45,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:58:45,306 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:58:45,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:58:45,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:58:45,307 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:58:45,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:58:45,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:58:45,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:58:45,307 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_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/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_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh 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 -> 83223bd52506e4247e7ac7ce7a49284be0292b773b9e827e6221f58042ba0602 [2022-12-14 11:58:45,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:58:45,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:58:45,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:58:45,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:58:45,519 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:58:45,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2022-12-14 11:58:48,065 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:58:48,244 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:58:48,245 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2022-12-14 11:58:48,251 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/data/5d40c2573/dfad448a2942483c919ca4cff469e09a/FLAGa0759992e [2022-12-14 11:58:48,660 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/data/5d40c2573/dfad448a2942483c919ca4cff469e09a [2022-12-14 11:58:48,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:58:48,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:58:48,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:58:48,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:58:48,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:58:48,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc01203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48, skipping insertion in model container [2022-12-14 11:58:48,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:58:48,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:58:48,843 WARN L237 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_9607b24b-d590-4971-b0c1-a7b91bc416b9/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c[4836,4849] [2022-12-14 11:58:48,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:58:48,862 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:58:48,888 WARN L237 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_9607b24b-d590-4971-b0c1-a7b91bc416b9/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c[4836,4849] [2022-12-14 11:58:48,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:58:48,905 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:58:48,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48 WrapperNode [2022-12-14 11:58:48,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:58:48,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:58:48,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:58:48,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:58:48,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,946 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 297 [2022-12-14 11:58:48,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:58:48,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:58:48,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:58:48,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:58:48,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,974 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:58:48,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:58:48,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:58:48,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:58:48,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (1/1) ... [2022-12-14 11:58:48,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:58:48,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:58:49,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:58:49,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:58:49,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:58:49,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:58:49,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 11:58:49,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 11:58:49,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 11:58:49,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 11:58:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 11:58:49,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 11:58:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 11:58:49,044 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 11:58:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:58:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 11:58:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:58:49,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:58:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:58:49,046 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 11:58:49,148 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:58:49,150 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:58:49,478 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:58:49,494 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:58:49,494 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 11:58:49,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:58:49 BoogieIcfgContainer [2022-12-14 11:58:49,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:58:49,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:58:49,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:58:49,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:58:49,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:58:48" (1/3) ... [2022-12-14 11:58:49,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42106411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:58:49, skipping insertion in model container [2022-12-14 11:58:49,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:58:48" (2/3) ... [2022-12-14 11:58:49,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42106411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:58:49, skipping insertion in model container [2022-12-14 11:58:49,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:58:49" (3/3) ... [2022-12-14 11:58:49,505 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2022-12-14 11:58:49,512 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 11:58:49,520 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:58:49,520 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 11:58:49,521 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 11:58:49,609 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-14 11:58:49,665 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 11:58:49,676 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 375 transitions, 774 flow [2022-12-14 11:58:49,678 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 359 places, 375 transitions, 774 flow [2022-12-14 11:58:49,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 359 places, 375 transitions, 774 flow [2022-12-14 11:58:49,822 INFO L130 PetriNetUnfolder]: 26/372 cut-off events. [2022-12-14 11:58:49,822 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-14 11:58:49,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 372 events. 26/372 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 876 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 274. Up to 2 conditions per place. [2022-12-14 11:58:49,860 INFO L119 LiptonReduction]: Number of co-enabled transitions 34440 [2022-12-14 11:58:59,513 INFO L134 LiptonReduction]: Checked pairs total: 31066 [2022-12-14 11:58:59,513 INFO L136 LiptonReduction]: Total number of compositions: 436 [2022-12-14 11:58:59,519 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2022-12-14 11:58:59,534 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 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-12-14 11:58:59,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:58:59,551 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;@41260b5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:58:59,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-14 11:58:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 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-12-14 11:58:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 11:58:59,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:58:59,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:58:59,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:58:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:58:59,562 INFO L85 PathProgramCache]: Analyzing trace with hash 728756247, now seen corresponding path program 1 times [2022-12-14 11:58:59,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:58:59,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398231678] [2022-12-14 11:58:59,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:58:59,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:58:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:58:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:58:59,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:58:59,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398231678] [2022-12-14 11:58:59,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398231678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:58:59,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:58:59,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:58:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389110447] [2022-12-14 11:58:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:58:59,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:58:59,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:58:59,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:58:59,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:58:59,923 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 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, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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-12-14 11:58:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:58:59,984 INFO L93 Difference]: Finished difference Result 108 states and 328 transitions. [2022-12-14 11:58:59,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:58:59,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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 20 [2022-12-14 11:58:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:58:59,995 INFO L225 Difference]: With dead ends: 108 [2022-12-14 11:58:59,995 INFO L226 Difference]: Without dead ends: 108 [2022-12-14 11:58:59,995 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-12-14 11:58:59,998 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:58:59,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:59:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-12-14 11:59:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-12-14 11:59:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 3.0654205607476634) internal successors, (328), 107 states have internal predecessors, (328), 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-12-14 11:59:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 328 transitions. [2022-12-14 11:59:00,037 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 328 transitions. Word has length 20 [2022-12-14 11:59:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:00,037 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 328 transitions. [2022-12-14 11:59:00,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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-12-14 11:59:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 328 transitions. [2022-12-14 11:59:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 11:59:00,039 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:00,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:00,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:59:00,040 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:00,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1049130014, now seen corresponding path program 1 times [2022-12-14 11:59:00,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:00,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095659239] [2022-12-14 11:59:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:59:00,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:00,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095659239] [2022-12-14 11:59:00,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095659239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:59:00,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865953385] [2022-12-14 11:59:00,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:00,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:59:00,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:59:00,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:59:00,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:59:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:00,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 11:59:00,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:59:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:59:00,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:59:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:59:00,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865953385] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:59:00,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1817997050] [2022-12-14 11:59:00,372 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 11:59:00,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:59:00,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-14 11:59:00,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260749893] [2022-12-14 11:59:00,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:59:00,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:00,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:00,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:00,377 INFO L87 Difference]: Start difference. First operand 108 states and 328 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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-12-14 11:59:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:00,450 INFO L93 Difference]: Finished difference Result 110 states and 330 transitions. [2022-12-14 11:59:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:59:00,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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 21 [2022-12-14 11:59:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:00,452 INFO L225 Difference]: With dead ends: 110 [2022-12-14 11:59:00,452 INFO L226 Difference]: Without dead ends: 110 [2022-12-14 11:59:00,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:00,454 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:00,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-14 11:59:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-12-14 11:59:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 3.0275229357798166) internal successors, (330), 109 states have internal predecessors, (330), 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-12-14 11:59:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 330 transitions. [2022-12-14 11:59:00,466 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 330 transitions. Word has length 21 [2022-12-14 11:59:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:00,467 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 330 transitions. [2022-12-14 11:59:00,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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-12-14 11:59:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 330 transitions. [2022-12-14 11:59:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:00,468 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:00,468 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:00,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:59:00,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-14 11:59:00,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:00,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash 519257730, now seen corresponding path program 2 times [2022-12-14 11:59:00,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:00,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029387448] [2022-12-14 11:59:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:00,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:01,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:01,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029387448] [2022-12-14 11:59:01,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029387448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:01,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:01,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:01,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483940404] [2022-12-14 11:59:01,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:01,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:01,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:01,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:01,486 INFO L87 Difference]: Start difference. First operand 110 states and 330 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:01,711 INFO L93 Difference]: Finished difference Result 237 states and 673 transitions. [2022-12-14 11:59:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:01,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:01,713 INFO L225 Difference]: With dead ends: 237 [2022-12-14 11:59:01,713 INFO L226 Difference]: Without dead ends: 216 [2022-12-14 11:59:01,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:01,713 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:01,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-12-14 11:59:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 130. [2022-12-14 11:59:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.9844961240310077) internal successors, (385), 129 states have internal predecessors, (385), 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-12-14 11:59:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 385 transitions. [2022-12-14 11:59:01,726 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 385 transitions. Word has length 23 [2022-12-14 11:59:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:01,726 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 385 transitions. [2022-12-14 11:59:01,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 385 transitions. [2022-12-14 11:59:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:01,727 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:01,728 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:01,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:59:01,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1570126778, now seen corresponding path program 3 times [2022-12-14 11:59:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:01,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7840006] [2022-12-14 11:59:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:02,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:02,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7840006] [2022-12-14 11:59:02,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7840006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:02,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:02,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:59:02,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238716609] [2022-12-14 11:59:02,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:02,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:59:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:02,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:59:02,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:59:02,275 INFO L87 Difference]: Start difference. First operand 130 states and 385 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:02,465 INFO L93 Difference]: Finished difference Result 269 states and 777 transitions. [2022-12-14 11:59:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:59:02,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:02,468 INFO L225 Difference]: With dead ends: 269 [2022-12-14 11:59:02,468 INFO L226 Difference]: Without dead ends: 258 [2022-12-14 11:59:02,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:02,469 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:02,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-14 11:59:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 162. [2022-12-14 11:59:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 3.1677018633540373) internal successors, (510), 161 states have internal predecessors, (510), 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-12-14 11:59:02,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 510 transitions. [2022-12-14 11:59:02,481 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 510 transitions. Word has length 23 [2022-12-14 11:59:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:02,482 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 510 transitions. [2022-12-14 11:59:02,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 510 transitions. [2022-12-14 11:59:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:02,483 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:02,483 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:02,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 11:59:02,484 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:02,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:02,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2043803678, now seen corresponding path program 4 times [2022-12-14 11:59:02,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:02,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621351947] [2022-12-14 11:59:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:03,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:03,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621351947] [2022-12-14 11:59:03,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621351947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:03,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:03,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:59:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274611924] [2022-12-14 11:59:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:03,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:03,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:03,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:03,365 INFO L87 Difference]: Start difference. First operand 162 states and 510 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-12-14 11:59:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:03,991 INFO L93 Difference]: Finished difference Result 265 states and 780 transitions. [2022-12-14 11:59:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 11:59:03,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:03,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:03,994 INFO L225 Difference]: With dead ends: 265 [2022-12-14 11:59:03,994 INFO L226 Difference]: Without dead ends: 258 [2022-12-14 11:59:03,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:59:03,996 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:03,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:59:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-14 11:59:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 170. [2022-12-14 11:59:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.1538461538461537) internal successors, (533), 169 states have internal predecessors, (533), 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-12-14 11:59:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 533 transitions. [2022-12-14 11:59:04,008 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 533 transitions. Word has length 23 [2022-12-14 11:59:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:04,009 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 533 transitions. [2022-12-14 11:59:04,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-12-14 11:59:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 533 transitions. [2022-12-14 11:59:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:04,011 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:04,011 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:04,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 11:59:04,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1932726128, now seen corresponding path program 5 times [2022-12-14 11:59:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:04,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489649868] [2022-12-14 11:59:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:04,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:04,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489649868] [2022-12-14 11:59:04,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489649868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:04,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:04,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:59:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844158479] [2022-12-14 11:59:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:04,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:59:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:59:04,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:59:04,492 INFO L87 Difference]: Start difference. First operand 170 states and 533 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:04,656 INFO L93 Difference]: Finished difference Result 243 states and 746 transitions. [2022-12-14 11:59:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:59:04,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:04,659 INFO L225 Difference]: With dead ends: 243 [2022-12-14 11:59:04,659 INFO L226 Difference]: Without dead ends: 232 [2022-12-14 11:59:04,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:04,660 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:04,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-12-14 11:59:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 190. [2022-12-14 11:59:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 3.1693121693121693) internal successors, (599), 189 states have internal predecessors, (599), 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-12-14 11:59:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 599 transitions. [2022-12-14 11:59:04,665 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 599 transitions. Word has length 23 [2022-12-14 11:59:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:04,666 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 599 transitions. [2022-12-14 11:59:04,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 599 transitions. [2022-12-14 11:59:04,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:04,666 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:04,666 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:04,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 11:59:04,667 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:04,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1479267192, now seen corresponding path program 6 times [2022-12-14 11:59:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:04,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111882668] [2022-12-14 11:59:04,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:05,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:05,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111882668] [2022-12-14 11:59:05,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111882668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:05,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:05,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:05,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578514446] [2022-12-14 11:59:05,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:05,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:05,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:05,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:05,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:05,217 INFO L87 Difference]: Start difference. First operand 190 states and 599 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:05,498 INFO L93 Difference]: Finished difference Result 375 states and 1141 transitions. [2022-12-14 11:59:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:05,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:05,502 INFO L225 Difference]: With dead ends: 375 [2022-12-14 11:59:05,502 INFO L226 Difference]: Without dead ends: 362 [2022-12-14 11:59:05,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:59:05,503 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:05,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-12-14 11:59:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 198. [2022-12-14 11:59:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.1928934010152283) internal successors, (629), 197 states have internal predecessors, (629), 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-12-14 11:59:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 629 transitions. [2022-12-14 11:59:05,509 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 629 transitions. Word has length 23 [2022-12-14 11:59:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:05,510 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 629 transitions. [2022-12-14 11:59:05,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 629 transitions. [2022-12-14 11:59:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:05,510 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:05,510 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:05,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 11:59:05,511 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:05,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1271102502, now seen corresponding path program 7 times [2022-12-14 11:59:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:05,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202721085] [2022-12-14 11:59:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:06,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:06,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202721085] [2022-12-14 11:59:06,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202721085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:06,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:06,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367708487] [2022-12-14 11:59:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:06,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:06,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:06,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:06,070 INFO L87 Difference]: Start difference. First operand 198 states and 629 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:06,550 INFO L93 Difference]: Finished difference Result 469 states and 1456 transitions. [2022-12-14 11:59:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 11:59:06,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:06,554 INFO L225 Difference]: With dead ends: 469 [2022-12-14 11:59:06,554 INFO L226 Difference]: Without dead ends: 462 [2022-12-14 11:59:06,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:59:06,554 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:06,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:59:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-12-14 11:59:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 220. [2022-12-14 11:59:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 3.182648401826484) internal successors, (697), 219 states have internal predecessors, (697), 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-12-14 11:59:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 697 transitions. [2022-12-14 11:59:06,574 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 697 transitions. Word has length 23 [2022-12-14 11:59:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:06,575 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 697 transitions. [2022-12-14 11:59:06,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 697 transitions. [2022-12-14 11:59:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:06,576 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:06,576 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:06,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 11:59:06,577 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 580640150, now seen corresponding path program 8 times [2022-12-14 11:59:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:06,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61416791] [2022-12-14 11:59:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:07,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:07,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61416791] [2022-12-14 11:59:07,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61416791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:07,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:07,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:07,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303876590] [2022-12-14 11:59:07,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:07,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:07,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:07,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:07,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:07,235 INFO L87 Difference]: Start difference. First operand 220 states and 697 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:07,587 INFO L93 Difference]: Finished difference Result 417 states and 1279 transitions. [2022-12-14 11:59:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:07,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:07,590 INFO L225 Difference]: With dead ends: 417 [2022-12-14 11:59:07,590 INFO L226 Difference]: Without dead ends: 404 [2022-12-14 11:59:07,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:59:07,591 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:07,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-12-14 11:59:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 224. [2022-12-14 11:59:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 3.1704035874439462) internal successors, (707), 223 states have internal predecessors, (707), 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-12-14 11:59:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 707 transitions. [2022-12-14 11:59:07,602 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 707 transitions. Word has length 23 [2022-12-14 11:59:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:07,602 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 707 transitions. [2022-12-14 11:59:07,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 707 transitions. [2022-12-14 11:59:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:07,603 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:07,604 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:07,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 11:59:07,604 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash -636610598, now seen corresponding path program 9 times [2022-12-14 11:59:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:07,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365326365] [2022-12-14 11:59:07,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:08,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:08,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365326365] [2022-12-14 11:59:08,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365326365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:08,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:08,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665934349] [2022-12-14 11:59:08,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:08,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:08,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:08,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:08,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:08,092 INFO L87 Difference]: Start difference. First operand 224 states and 707 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:08,444 INFO L93 Difference]: Finished difference Result 459 states and 1422 transitions. [2022-12-14 11:59:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:08,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:08,447 INFO L225 Difference]: With dead ends: 459 [2022-12-14 11:59:08,447 INFO L226 Difference]: Without dead ends: 452 [2022-12-14 11:59:08,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:08,448 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:08,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:08,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-12-14 11:59:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 242. [2022-12-14 11:59:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 3.2946058091286305) internal successors, (794), 241 states have internal predecessors, (794), 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-12-14 11:59:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 794 transitions. [2022-12-14 11:59:08,460 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 794 transitions. Word has length 23 [2022-12-14 11:59:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:08,460 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 794 transitions. [2022-12-14 11:59:08,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 794 transitions. [2022-12-14 11:59:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:08,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:08,461 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:08,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 11:59:08,462 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:08,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:08,462 INFO L85 PathProgramCache]: Analyzing trace with hash -849083352, now seen corresponding path program 10 times [2022-12-14 11:59:08,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:08,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805413518] [2022-12-14 11:59:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:08,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:08,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805413518] [2022-12-14 11:59:08,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805413518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:08,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:08,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:59:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302092048] [2022-12-14 11:59:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:59:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:59:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:59:08,888 INFO L87 Difference]: Start difference. First operand 242 states and 794 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:09,061 INFO L93 Difference]: Finished difference Result 353 states and 1105 transitions. [2022-12-14 11:59:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:59:09,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:09,063 INFO L225 Difference]: With dead ends: 353 [2022-12-14 11:59:09,063 INFO L226 Difference]: Without dead ends: 342 [2022-12-14 11:59:09,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:09,064 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:09,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-12-14 11:59:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 250. [2022-12-14 11:59:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.36144578313253) internal successors, (837), 249 states have internal predecessors, (837), 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-12-14 11:59:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 837 transitions. [2022-12-14 11:59:09,074 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 837 transitions. Word has length 23 [2022-12-14 11:59:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:09,074 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 837 transitions. [2022-12-14 11:59:09,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 837 transitions. [2022-12-14 11:59:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:09,075 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:09,076 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:09,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 11:59:09,076 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:09,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash -375406452, now seen corresponding path program 11 times [2022-12-14 11:59:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:09,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85510160] [2022-12-14 11:59:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:09,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:09,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85510160] [2022-12-14 11:59:09,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85510160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:09,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:09,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:59:09,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483569946] [2022-12-14 11:59:09,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:09,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:59:09,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:09,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:59:09,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:59:09,468 INFO L87 Difference]: Start difference. First operand 250 states and 837 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:09,649 INFO L93 Difference]: Finished difference Result 345 states and 1087 transitions. [2022-12-14 11:59:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:59:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:09,651 INFO L225 Difference]: With dead ends: 345 [2022-12-14 11:59:09,651 INFO L226 Difference]: Without dead ends: 334 [2022-12-14 11:59:09,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:09,652 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:09,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-12-14 11:59:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 246. [2022-12-14 11:59:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.3387755102040817) internal successors, (818), 245 states have internal predecessors, (818), 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-12-14 11:59:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 818 transitions. [2022-12-14 11:59:09,662 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 818 transitions. Word has length 23 [2022-12-14 11:59:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:09,662 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 818 transitions. [2022-12-14 11:59:09,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 818 transitions. [2022-12-14 11:59:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:09,663 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:09,663 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:09,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 11:59:09,664 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash 545877250, now seen corresponding path program 12 times [2022-12-14 11:59:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:09,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174919635] [2022-12-14 11:59:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:10,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:10,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174919635] [2022-12-14 11:59:10,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174919635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:10,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:10,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:59:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918114395] [2022-12-14 11:59:10,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:10,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:59:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:10,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:59:10,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:59:10,129 INFO L87 Difference]: Start difference. First operand 246 states and 818 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:10,350 INFO L93 Difference]: Finished difference Result 333 states and 1042 transitions. [2022-12-14 11:59:10,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:59:10,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:10,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:10,352 INFO L225 Difference]: With dead ends: 333 [2022-12-14 11:59:10,352 INFO L226 Difference]: Without dead ends: 320 [2022-12-14 11:59:10,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:10,353 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:10,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-12-14 11:59:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 250. [2022-12-14 11:59:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.3092369477911645) internal successors, (824), 249 states have internal predecessors, (824), 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-12-14 11:59:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 824 transitions. [2022-12-14 11:59:10,358 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 824 transitions. Word has length 23 [2022-12-14 11:59:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:10,358 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 824 transitions. [2022-12-14 11:59:10,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 824 transitions. [2022-12-14 11:59:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:10,359 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:10,359 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:10,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 11:59:10,359 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash -831656426, now seen corresponding path program 13 times [2022-12-14 11:59:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:10,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743858530] [2022-12-14 11:59:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:10,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:10,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:10,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743858530] [2022-12-14 11:59:10,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743858530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:10,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:10,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:10,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333430916] [2022-12-14 11:59:10,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:10,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:10,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:10,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:10,786 INFO L87 Difference]: Start difference. First operand 250 states and 824 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:11,209 INFO L93 Difference]: Finished difference Result 413 states and 1316 transitions. [2022-12-14 11:59:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:11,211 INFO L225 Difference]: With dead ends: 413 [2022-12-14 11:59:11,211 INFO L226 Difference]: Without dead ends: 406 [2022-12-14 11:59:11,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:59:11,212 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:11,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-12-14 11:59:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 254. [2022-12-14 11:59:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 3.3399209486166006) internal successors, (845), 253 states have internal predecessors, (845), 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-12-14 11:59:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 845 transitions. [2022-12-14 11:59:11,217 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 845 transitions. Word has length 23 [2022-12-14 11:59:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:11,218 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 845 transitions. [2022-12-14 11:59:11,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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-12-14 11:59:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 845 transitions. [2022-12-14 11:59:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 11:59:11,218 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:11,218 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:11,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 11:59:11,219 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:11,219 INFO L85 PathProgramCache]: Analyzing trace with hash -938986310, now seen corresponding path program 14 times [2022-12-14 11:59:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:11,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443126476] [2022-12-14 11:59:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:11,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:11,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443126476] [2022-12-14 11:59:11,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443126476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:11,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:11,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:59:11,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436277870] [2022-12-14 11:59:11,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:11,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:59:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:11,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:59:11,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:59:11,521 INFO L87 Difference]: Start difference. First operand 254 states and 845 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:11,688 INFO L93 Difference]: Finished difference Result 325 states and 1032 transitions. [2022-12-14 11:59:11,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:59:11,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 23 [2022-12-14 11:59:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:11,691 INFO L225 Difference]: With dead ends: 325 [2022-12-14 11:59:11,691 INFO L226 Difference]: Without dead ends: 312 [2022-12-14 11:59:11,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:11,692 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:11,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-12-14 11:59:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 246. [2022-12-14 11:59:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 3.2775510204081635) internal successors, (803), 245 states have internal predecessors, (803), 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-12-14 11:59:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 803 transitions. [2022-12-14 11:59:11,697 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 803 transitions. Word has length 23 [2022-12-14 11:59:11,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:11,697 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 803 transitions. [2022-12-14 11:59:11,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-12-14 11:59:11,697 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 803 transitions. [2022-12-14 11:59:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:11,698 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:11,698 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:11,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 11:59:11,698 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:11,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:11,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1544647465, now seen corresponding path program 1 times [2022-12-14 11:59:11,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:11,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245354835] [2022-12-14 11:59:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:11,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:11,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245354835] [2022-12-14 11:59:11,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245354835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:11,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:11,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:11,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667034065] [2022-12-14 11:59:11,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:11,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:11,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:11,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:11,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:11,969 INFO L87 Difference]: Start difference. First operand 246 states and 803 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:12,159 INFO L93 Difference]: Finished difference Result 434 states and 1323 transitions. [2022-12-14 11:59:12,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:12,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:12,163 INFO L225 Difference]: With dead ends: 434 [2022-12-14 11:59:12,163 INFO L226 Difference]: Without dead ends: 434 [2022-12-14 11:59:12,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:12,164 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:12,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-12-14 11:59:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 256. [2022-12-14 11:59:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 3.2901960784313724) internal successors, (839), 255 states have internal predecessors, (839), 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-12-14 11:59:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 839 transitions. [2022-12-14 11:59:12,170 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 839 transitions. Word has length 24 [2022-12-14 11:59:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:12,170 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 839 transitions. [2022-12-14 11:59:12,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 839 transitions. [2022-12-14 11:59:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:12,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:12,170 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:12,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 11:59:12,171 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash 4280927, now seen corresponding path program 2 times [2022-12-14 11:59:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:12,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672043103] [2022-12-14 11:59:12,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:12,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:12,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672043103] [2022-12-14 11:59:12,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672043103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:12,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:12,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:12,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093473395] [2022-12-14 11:59:12,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:12,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:12,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:12,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:12,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:12,446 INFO L87 Difference]: Start difference. First operand 256 states and 839 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:12,898 INFO L93 Difference]: Finished difference Result 460 states and 1395 transitions. [2022-12-14 11:59:12,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 11:59:12,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:12,900 INFO L225 Difference]: With dead ends: 460 [2022-12-14 11:59:12,900 INFO L226 Difference]: Without dead ends: 460 [2022-12-14 11:59:12,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-14 11:59:12,901 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:12,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-12-14 11:59:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 260. [2022-12-14 11:59:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 3.312741312741313) internal successors, (858), 259 states have internal predecessors, (858), 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-12-14 11:59:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 858 transitions. [2022-12-14 11:59:12,907 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 858 transitions. Word has length 24 [2022-12-14 11:59:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:12,907 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 858 transitions. [2022-12-14 11:59:12,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 858 transitions. [2022-12-14 11:59:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:12,907 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:12,908 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:12,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 11:59:12,908 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:12,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1779288289, now seen corresponding path program 1 times [2022-12-14 11:59:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:12,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030858556] [2022-12-14 11:59:12,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:13,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:13,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030858556] [2022-12-14 11:59:13,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030858556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:13,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:13,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277634938] [2022-12-14 11:59:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:13,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:13,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:13,160 INFO L87 Difference]: Start difference. First operand 260 states and 858 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:13,324 INFO L93 Difference]: Finished difference Result 434 states and 1328 transitions. [2022-12-14 11:59:13,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:13,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:13,326 INFO L225 Difference]: With dead ends: 434 [2022-12-14 11:59:13,326 INFO L226 Difference]: Without dead ends: 434 [2022-12-14 11:59:13,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:13,326 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:13,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-12-14 11:59:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 260. [2022-12-14 11:59:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 3.312741312741313) internal successors, (858), 259 states have internal predecessors, (858), 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-12-14 11:59:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 858 transitions. [2022-12-14 11:59:13,333 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 858 transitions. Word has length 24 [2022-12-14 11:59:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:13,333 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 858 transitions. [2022-12-14 11:59:13,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 858 transitions. [2022-12-14 11:59:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:13,334 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:13,334 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:13,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 11:59:13,334 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:13,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:13,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1418520453, now seen corresponding path program 2 times [2022-12-14 11:59:13,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:13,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069373398] [2022-12-14 11:59:13,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:13,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:13,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069373398] [2022-12-14 11:59:13,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069373398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:13,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:13,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:13,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291756114] [2022-12-14 11:59:13,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:13,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:13,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:13,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:13,602 INFO L87 Difference]: Start difference. First operand 260 states and 858 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:13,827 INFO L93 Difference]: Finished difference Result 416 states and 1291 transitions. [2022-12-14 11:59:13,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:13,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:13,831 INFO L225 Difference]: With dead ends: 416 [2022-12-14 11:59:13,831 INFO L226 Difference]: Without dead ends: 410 [2022-12-14 11:59:13,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:13,832 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:13,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-12-14 11:59:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 260. [2022-12-14 11:59:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 3.2972972972972974) internal successors, (854), 259 states have internal predecessors, (854), 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-12-14 11:59:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 854 transitions. [2022-12-14 11:59:13,842 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 854 transitions. Word has length 24 [2022-12-14 11:59:13,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:13,842 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 854 transitions. [2022-12-14 11:59:13,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 854 transitions. [2022-12-14 11:59:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:13,843 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:13,843 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:13,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 11:59:13,844 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:13,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1242764463, now seen corresponding path program 3 times [2022-12-14 11:59:13,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:13,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748776484] [2022-12-14 11:59:13,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:14,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:14,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748776484] [2022-12-14 11:59:14,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748776484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:14,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:14,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:14,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866801813] [2022-12-14 11:59:14,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:14,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:14,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:14,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:14,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:14,093 INFO L87 Difference]: Start difference. First operand 260 states and 854 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:14,313 INFO L93 Difference]: Finished difference Result 420 states and 1287 transitions. [2022-12-14 11:59:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:14,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:14,315 INFO L225 Difference]: With dead ends: 420 [2022-12-14 11:59:14,315 INFO L226 Difference]: Without dead ends: 416 [2022-12-14 11:59:14,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:14,315 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:14,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-12-14 11:59:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 260. [2022-12-14 11:59:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 3.281853281853282) internal successors, (850), 259 states have internal predecessors, (850), 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-12-14 11:59:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 850 transitions. [2022-12-14 11:59:14,322 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 850 transitions. Word has length 24 [2022-12-14 11:59:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:14,322 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 850 transitions. [2022-12-14 11:59:14,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 850 transitions. [2022-12-14 11:59:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:14,323 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:14,323 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:14,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 11:59:14,324 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:14,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash -391201217, now seen corresponding path program 4 times [2022-12-14 11:59:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:14,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321795733] [2022-12-14 11:59:14,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:14,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:14,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:14,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321795733] [2022-12-14 11:59:14,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321795733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:14,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:14,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389383844] [2022-12-14 11:59:14,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:14,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:14,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:14,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:14,549 INFO L87 Difference]: Start difference. First operand 260 states and 850 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:14,884 INFO L93 Difference]: Finished difference Result 418 states and 1296 transitions. [2022-12-14 11:59:14,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 11:59:14,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:14,888 INFO L225 Difference]: With dead ends: 418 [2022-12-14 11:59:14,888 INFO L226 Difference]: Without dead ends: 410 [2022-12-14 11:59:14,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-12-14 11:59:14,888 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:14,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-12-14 11:59:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 264. [2022-12-14 11:59:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 3.273764258555133) internal successors, (861), 263 states have internal predecessors, (861), 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-12-14 11:59:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 861 transitions. [2022-12-14 11:59:14,895 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 861 transitions. Word has length 24 [2022-12-14 11:59:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:14,895 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 861 transitions. [2022-12-14 11:59:14,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 861 transitions. [2022-12-14 11:59:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:14,896 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:14,896 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:14,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 11:59:14,896 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1482601057, now seen corresponding path program 5 times [2022-12-14 11:59:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:14,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796573931] [2022-12-14 11:59:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:15,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:15,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796573931] [2022-12-14 11:59:15,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796573931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:15,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:15,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925795276] [2022-12-14 11:59:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:15,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:15,137 INFO L87 Difference]: Start difference. First operand 264 states and 861 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:15,360 INFO L93 Difference]: Finished difference Result 436 states and 1333 transitions. [2022-12-14 11:59:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:15,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:15,362 INFO L225 Difference]: With dead ends: 436 [2022-12-14 11:59:15,362 INFO L226 Difference]: Without dead ends: 436 [2022-12-14 11:59:15,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:15,363 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:15,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-12-14 11:59:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 268. [2022-12-14 11:59:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 3.2808988764044944) internal successors, (876), 267 states have internal predecessors, (876), 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-12-14 11:59:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 876 transitions. [2022-12-14 11:59:15,368 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 876 transitions. Word has length 24 [2022-12-14 11:59:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:15,369 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 876 transitions. [2022-12-14 11:59:15,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 876 transitions. [2022-12-14 11:59:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:15,369 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:15,369 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:15,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 11:59:15,370 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:15,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash 235555667, now seen corresponding path program 6 times [2022-12-14 11:59:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:15,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238111347] [2022-12-14 11:59:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:15,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:15,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238111347] [2022-12-14 11:59:15,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238111347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:15,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:15,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177619946] [2022-12-14 11:59:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:15,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:15,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:15,589 INFO L87 Difference]: Start difference. First operand 268 states and 876 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:15,761 INFO L93 Difference]: Finished difference Result 424 states and 1311 transitions. [2022-12-14 11:59:15,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:15,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:15,762 INFO L225 Difference]: With dead ends: 424 [2022-12-14 11:59:15,762 INFO L226 Difference]: Without dead ends: 420 [2022-12-14 11:59:15,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:15,763 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:15,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-12-14 11:59:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 264. [2022-12-14 11:59:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 3.273764258555133) internal successors, (861), 263 states have internal predecessors, (861), 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-12-14 11:59:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 861 transitions. [2022-12-14 11:59:15,768 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 861 transitions. Word has length 24 [2022-12-14 11:59:15,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:15,768 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 861 transitions. [2022-12-14 11:59:15,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 861 transitions. [2022-12-14 11:59:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:15,769 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:15,769 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:15,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 11:59:15,769 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1401888949, now seen corresponding path program 7 times [2022-12-14 11:59:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:15,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258516937] [2022-12-14 11:59:15,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:15,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:16,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:16,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258516937] [2022-12-14 11:59:16,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258516937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:16,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:16,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:16,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321375013] [2022-12-14 11:59:16,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:16,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:16,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:16,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:16,019 INFO L87 Difference]: Start difference. First operand 264 states and 861 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:16,213 INFO L93 Difference]: Finished difference Result 560 states and 1717 transitions. [2022-12-14 11:59:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:16,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:16,215 INFO L225 Difference]: With dead ends: 560 [2022-12-14 11:59:16,215 INFO L226 Difference]: Without dead ends: 560 [2022-12-14 11:59:16,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:16,215 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:16,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-12-14 11:59:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 272. [2022-12-14 11:59:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.302583025830258) internal successors, (895), 271 states have internal predecessors, (895), 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-12-14 11:59:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 895 transitions. [2022-12-14 11:59:16,221 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 895 transitions. Word has length 24 [2022-12-14 11:59:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:16,221 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 895 transitions. [2022-12-14 11:59:16,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 895 transitions. [2022-12-14 11:59:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:16,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:16,222 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:16,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 11:59:16,222 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:16,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1041335695, now seen corresponding path program 8 times [2022-12-14 11:59:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:16,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551014157] [2022-12-14 11:59:16,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:16,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:16,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551014157] [2022-12-14 11:59:16,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551014157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:16,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:16,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:16,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885023038] [2022-12-14 11:59:16,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:16,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:16,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:16,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:16,494 INFO L87 Difference]: Start difference. First operand 272 states and 895 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:16,672 INFO L93 Difference]: Finished difference Result 576 states and 1761 transitions. [2022-12-14 11:59:16,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:16,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:16,674 INFO L225 Difference]: With dead ends: 576 [2022-12-14 11:59:16,674 INFO L226 Difference]: Without dead ends: 576 [2022-12-14 11:59:16,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:16,674 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:16,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-12-14 11:59:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 276. [2022-12-14 11:59:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 3.3345454545454545) internal successors, (917), 275 states have internal predecessors, (917), 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-12-14 11:59:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 917 transitions. [2022-12-14 11:59:16,681 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 917 transitions. Word has length 24 [2022-12-14 11:59:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:16,682 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 917 transitions. [2022-12-14 11:59:16,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 917 transitions. [2022-12-14 11:59:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:16,683 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:16,683 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:16,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 11:59:16,683 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash 377501747, now seen corresponding path program 9 times [2022-12-14 11:59:16,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:16,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843025324] [2022-12-14 11:59:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:16,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:16,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843025324] [2022-12-14 11:59:16,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843025324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:16,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:16,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:16,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219360050] [2022-12-14 11:59:16,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:16,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:16,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:16,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:16,991 INFO L87 Difference]: Start difference. First operand 276 states and 917 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:17,225 INFO L93 Difference]: Finished difference Result 554 states and 1715 transitions. [2022-12-14 11:59:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:17,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:17,228 INFO L225 Difference]: With dead ends: 554 [2022-12-14 11:59:17,228 INFO L226 Difference]: Without dead ends: 554 [2022-12-14 11:59:17,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:17,229 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:17,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-12-14 11:59:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 278. [2022-12-14 11:59:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 3.335740072202166) internal successors, (924), 277 states have internal predecessors, (924), 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-12-14 11:59:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 924 transitions. [2022-12-14 11:59:17,235 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 924 transitions. Word has length 24 [2022-12-14 11:59:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:17,235 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 924 transitions. [2022-12-14 11:59:17,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 924 transitions. [2022-12-14 11:59:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:17,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:17,235 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:17,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 11:59:17,236 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1878055121, now seen corresponding path program 10 times [2022-12-14 11:59:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:17,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792642314] [2022-12-14 11:59:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:17,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:17,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792642314] [2022-12-14 11:59:17,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792642314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:17,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:17,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123777847] [2022-12-14 11:59:17,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:17,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:17,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:17,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:17,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:17,531 INFO L87 Difference]: Start difference. First operand 278 states and 924 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:17,741 INFO L93 Difference]: Finished difference Result 594 states and 1821 transitions. [2022-12-14 11:59:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:17,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:17,744 INFO L225 Difference]: With dead ends: 594 [2022-12-14 11:59:17,745 INFO L226 Difference]: Without dead ends: 594 [2022-12-14 11:59:17,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:17,745 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:17,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-12-14 11:59:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 284. [2022-12-14 11:59:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.3392226148409896) internal successors, (945), 283 states have internal predecessors, (945), 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-12-14 11:59:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 945 transitions. [2022-12-14 11:59:17,751 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 945 transitions. Word has length 24 [2022-12-14 11:59:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:17,751 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 945 transitions. [2022-12-14 11:59:17,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 945 transitions. [2022-12-14 11:59:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:17,752 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:17,752 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:17,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 11:59:17,752 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash -749689527, now seen corresponding path program 3 times [2022-12-14 11:59:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:17,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876889575] [2022-12-14 11:59:17,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:17,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:17,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:17,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876889575] [2022-12-14 11:59:17,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876889575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:17,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:17,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489000407] [2022-12-14 11:59:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:17,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:17,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:17,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:17,990 INFO L87 Difference]: Start difference. First operand 284 states and 945 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:18,242 INFO L93 Difference]: Finished difference Result 524 states and 1594 transitions. [2022-12-14 11:59:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:18,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:18,244 INFO L225 Difference]: With dead ends: 524 [2022-12-14 11:59:18,244 INFO L226 Difference]: Without dead ends: 510 [2022-12-14 11:59:18,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:18,245 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:18,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-12-14 11:59:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 284. [2022-12-14 11:59:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.3180212014134276) internal successors, (939), 283 states have internal predecessors, (939), 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-12-14 11:59:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 939 transitions. [2022-12-14 11:59:18,253 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 939 transitions. Word has length 24 [2022-12-14 11:59:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:18,253 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 939 transitions. [2022-12-14 11:59:18,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 939 transitions. [2022-12-14 11:59:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:18,254 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:18,254 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:18,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 11:59:18,255 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash 337688583, now seen corresponding path program 11 times [2022-12-14 11:59:18,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:18,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038408098] [2022-12-14 11:59:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:18,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:18,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038408098] [2022-12-14 11:59:18,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038408098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:18,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:18,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059601176] [2022-12-14 11:59:18,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:18,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:18,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:18,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:18,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:18,521 INFO L87 Difference]: Start difference. First operand 284 states and 939 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:18,655 INFO L93 Difference]: Finished difference Result 564 states and 1737 transitions. [2022-12-14 11:59:18,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:18,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:18,659 INFO L225 Difference]: With dead ends: 564 [2022-12-14 11:59:18,659 INFO L226 Difference]: Without dead ends: 564 [2022-12-14 11:59:18,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:18,660 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:18,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-12-14 11:59:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 288. [2022-12-14 11:59:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.337979094076655) internal successors, (958), 287 states have internal predecessors, (958), 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-12-14 11:59:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 958 transitions. [2022-12-14 11:59:18,667 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 958 transitions. Word has length 24 [2022-12-14 11:59:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:18,667 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 958 transitions. [2022-12-14 11:59:18,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 958 transitions. [2022-12-14 11:59:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:18,668 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:18,668 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:18,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 11:59:18,668 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2112695945, now seen corresponding path program 4 times [2022-12-14 11:59:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:18,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628048163] [2022-12-14 11:59:18,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:18,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:18,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:18,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628048163] [2022-12-14 11:59:18,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628048163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:18,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:18,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:18,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508671317] [2022-12-14 11:59:18,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:18,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:18,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:18,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:18,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:18,911 INFO L87 Difference]: Start difference. First operand 288 states and 958 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:19,073 INFO L93 Difference]: Finished difference Result 526 states and 1618 transitions. [2022-12-14 11:59:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:19,076 INFO L225 Difference]: With dead ends: 526 [2022-12-14 11:59:19,076 INFO L226 Difference]: Without dead ends: 526 [2022-12-14 11:59:19,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:19,077 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:19,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-12-14 11:59:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 288. [2022-12-14 11:59:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.337979094076655) internal successors, (958), 287 states have internal predecessors, (958), 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-12-14 11:59:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 958 transitions. [2022-12-14 11:59:19,083 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 958 transitions. Word has length 24 [2022-12-14 11:59:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:19,083 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 958 transitions. [2022-12-14 11:59:19,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 958 transitions. [2022-12-14 11:59:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:19,084 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:19,084 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:19,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 11:59:19,084 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1751928109, now seen corresponding path program 5 times [2022-12-14 11:59:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:19,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563337879] [2022-12-14 11:59:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:19,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:19,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563337879] [2022-12-14 11:59:19,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563337879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:19,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:19,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554496801] [2022-12-14 11:59:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:19,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:19,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:19,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:19,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:19,323 INFO L87 Difference]: Start difference. First operand 288 states and 958 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:19,525 INFO L93 Difference]: Finished difference Result 528 states and 1616 transitions. [2022-12-14 11:59:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:19,530 INFO L225 Difference]: With dead ends: 528 [2022-12-14 11:59:19,530 INFO L226 Difference]: Without dead ends: 522 [2022-12-14 11:59:19,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:19,531 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:19,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-12-14 11:59:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 288. [2022-12-14 11:59:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.3240418118466897) internal successors, (954), 287 states have internal predecessors, (954), 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-12-14 11:59:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 954 transitions. [2022-12-14 11:59:19,541 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 954 transitions. Word has length 24 [2022-12-14 11:59:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:19,541 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 954 transitions. [2022-12-14 11:59:19,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 954 transitions. [2022-12-14 11:59:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:19,542 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:19,542 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:19,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 11:59:19,542 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash -909356807, now seen corresponding path program 12 times [2022-12-14 11:59:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:19,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218084661] [2022-12-14 11:59:19,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:19,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:19,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:19,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218084661] [2022-12-14 11:59:19,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218084661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:19,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:19,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243812018] [2022-12-14 11:59:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:19,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:19,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:19,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:19,827 INFO L87 Difference]: Start difference. First operand 288 states and 954 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:20,104 INFO L93 Difference]: Finished difference Result 464 states and 1534 transitions. [2022-12-14 11:59:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:59:20,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:20,106 INFO L225 Difference]: With dead ends: 464 [2022-12-14 11:59:20,106 INFO L226 Difference]: Without dead ends: 460 [2022-12-14 11:59:20,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:20,106 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:20,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-12-14 11:59:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 278. [2022-12-14 11:59:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 3.335740072202166) internal successors, (924), 277 states have internal predecessors, (924), 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-12-14 11:59:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 924 transitions. [2022-12-14 11:59:20,114 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 924 transitions. Word has length 24 [2022-12-14 11:59:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:20,114 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 924 transitions. [2022-12-14 11:59:20,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 924 transitions. [2022-12-14 11:59:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:20,115 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:20,115 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:20,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-14 11:59:20,115 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1174000763, now seen corresponding path program 6 times [2022-12-14 11:59:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:20,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973551764] [2022-12-14 11:59:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:20,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:20,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973551764] [2022-12-14 11:59:20,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973551764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:20,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:20,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:20,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961538727] [2022-12-14 11:59:20,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:20,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:20,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:20,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:20,361 INFO L87 Difference]: Start difference. First operand 278 states and 924 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:20,539 INFO L93 Difference]: Finished difference Result 474 states and 1469 transitions. [2022-12-14 11:59:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:20,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:20,540 INFO L225 Difference]: With dead ends: 474 [2022-12-14 11:59:20,541 INFO L226 Difference]: Without dead ends: 460 [2022-12-14 11:59:20,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:20,541 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:20,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-12-14 11:59:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 278. [2022-12-14 11:59:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 3.32129963898917) internal successors, (920), 277 states have internal predecessors, (920), 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-12-14 11:59:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 920 transitions. [2022-12-14 11:59:20,546 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 920 transitions. Word has length 24 [2022-12-14 11:59:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:20,546 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 920 transitions. [2022-12-14 11:59:20,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 920 transitions. [2022-12-14 11:59:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:20,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:20,547 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:20,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 11:59:20,547 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:20,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2087731059, now seen corresponding path program 13 times [2022-12-14 11:59:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:20,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40799725] [2022-12-14 11:59:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:20,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:20,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:20,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40799725] [2022-12-14 11:59:20,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40799725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:20,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:20,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:20,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058227683] [2022-12-14 11:59:20,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:20,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:20,822 INFO L87 Difference]: Start difference. First operand 278 states and 920 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:21,100 INFO L93 Difference]: Finished difference Result 552 states and 1711 transitions. [2022-12-14 11:59:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:21,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:21,104 INFO L225 Difference]: With dead ends: 552 [2022-12-14 11:59:21,104 INFO L226 Difference]: Without dead ends: 552 [2022-12-14 11:59:21,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:21,104 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:21,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-12-14 11:59:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 282. [2022-12-14 11:59:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 3.3665480427046264) internal successors, (946), 281 states have internal predecessors, (946), 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-12-14 11:59:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 946 transitions. [2022-12-14 11:59:21,110 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 946 transitions. Word has length 24 [2022-12-14 11:59:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:21,110 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 946 transitions. [2022-12-14 11:59:21,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 946 transitions. [2022-12-14 11:59:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:21,111 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:21,111 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:21,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-14 11:59:21,111 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:21,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash 152060285, now seen corresponding path program 14 times [2022-12-14 11:59:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:21,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124517195] [2022-12-14 11:59:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:21,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:21,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:21,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124517195] [2022-12-14 11:59:21,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124517195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:21,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:21,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:21,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796751757] [2022-12-14 11:59:21,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:21,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:21,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:21,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:21,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:21,387 INFO L87 Difference]: Start difference. First operand 282 states and 946 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:21,815 INFO L93 Difference]: Finished difference Result 582 states and 1771 transitions. [2022-12-14 11:59:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:59:21,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:21,820 INFO L225 Difference]: With dead ends: 582 [2022-12-14 11:59:21,820 INFO L226 Difference]: Without dead ends: 582 [2022-12-14 11:59:21,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:21,820 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:21,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-12-14 11:59:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 280. [2022-12-14 11:59:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 3.3440860215053765) internal successors, (933), 279 states have internal predecessors, (933), 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-12-14 11:59:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 933 transitions. [2022-12-14 11:59:21,826 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 933 transitions. Word has length 24 [2022-12-14 11:59:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:21,826 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 933 transitions. [2022-12-14 11:59:21,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 933 transitions. [2022-12-14 11:59:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:21,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:21,827 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:21,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-14 11:59:21,827 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1694704049, now seen corresponding path program 7 times [2022-12-14 11:59:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:21,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059834155] [2022-12-14 11:59:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:22,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:22,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059834155] [2022-12-14 11:59:22,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059834155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:22,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:22,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:22,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198088491] [2022-12-14 11:59:22,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:22,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:22,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:22,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:22,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:22,101 INFO L87 Difference]: Start difference. First operand 280 states and 933 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:22,331 INFO L93 Difference]: Finished difference Result 520 states and 1625 transitions. [2022-12-14 11:59:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:22,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:22,334 INFO L225 Difference]: With dead ends: 520 [2022-12-14 11:59:22,334 INFO L226 Difference]: Without dead ends: 520 [2022-12-14 11:59:22,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:22,335 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:22,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-12-14 11:59:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 284. [2022-12-14 11:59:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.374558303886926) internal successors, (955), 283 states have internal predecessors, (955), 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-12-14 11:59:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 955 transitions. [2022-12-14 11:59:22,343 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 955 transitions. Word has length 24 [2022-12-14 11:59:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:22,343 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 955 transitions. [2022-12-14 11:59:22,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 955 transitions. [2022-12-14 11:59:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:22,344 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:22,344 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:22,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-14 11:59:22,344 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:22,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1580348783, now seen corresponding path program 8 times [2022-12-14 11:59:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:22,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630871154] [2022-12-14 11:59:22,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:22,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:22,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630871154] [2022-12-14 11:59:22,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630871154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:22,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:22,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:22,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489821605] [2022-12-14 11:59:22,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:22,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:22,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:22,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:22,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:22,597 INFO L87 Difference]: Start difference. First operand 284 states and 955 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:22,896 INFO L93 Difference]: Finished difference Result 516 states and 1613 transitions. [2022-12-14 11:59:22,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:22,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:22,898 INFO L225 Difference]: With dead ends: 516 [2022-12-14 11:59:22,898 INFO L226 Difference]: Without dead ends: 516 [2022-12-14 11:59:22,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:22,899 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:22,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:22,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-12-14 11:59:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 284. [2022-12-14 11:59:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.374558303886926) internal successors, (955), 283 states have internal predecessors, (955), 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-12-14 11:59:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 955 transitions. [2022-12-14 11:59:22,904 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 955 transitions. Word has length 24 [2022-12-14 11:59:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:22,904 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 955 transitions. [2022-12-14 11:59:22,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 955 transitions. [2022-12-14 11:59:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:22,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:22,905 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:22,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-14 11:59:22,905 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1019897231, now seen corresponding path program 15 times [2022-12-14 11:59:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:22,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661798999] [2022-12-14 11:59:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:23,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:23,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661798999] [2022-12-14 11:59:23,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661798999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:23,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:23,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:23,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766080517] [2022-12-14 11:59:23,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:23,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:23,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:23,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:23,183 INFO L87 Difference]: Start difference. First operand 284 states and 955 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:23,434 INFO L93 Difference]: Finished difference Result 534 states and 1643 transitions. [2022-12-14 11:59:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:23,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:23,436 INFO L225 Difference]: With dead ends: 534 [2022-12-14 11:59:23,436 INFO L226 Difference]: Without dead ends: 534 [2022-12-14 11:59:23,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:23,437 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:23,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-12-14 11:59:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 288. [2022-12-14 11:59:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.3937282229965158) internal successors, (974), 287 states have internal predecessors, (974), 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-12-14 11:59:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 974 transitions. [2022-12-14 11:59:23,442 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 974 transitions. Word has length 24 [2022-12-14 11:59:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:23,442 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 974 transitions. [2022-12-14 11:59:23,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 974 transitions. [2022-12-14 11:59:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:23,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:23,443 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:23,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-14 11:59:23,443 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:23,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash 396659247, now seen corresponding path program 9 times [2022-12-14 11:59:23,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:23,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148454046] [2022-12-14 11:59:23,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:23,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:23,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148454046] [2022-12-14 11:59:23,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148454046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:23,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:23,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:23,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220597685] [2022-12-14 11:59:23,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:23,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:23,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:23,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:23,685 INFO L87 Difference]: Start difference. First operand 288 states and 974 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:24,077 INFO L93 Difference]: Finished difference Result 548 states and 1699 transitions. [2022-12-14 11:59:24,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:59:24,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:24,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:24,079 INFO L225 Difference]: With dead ends: 548 [2022-12-14 11:59:24,079 INFO L226 Difference]: Without dead ends: 548 [2022-12-14 11:59:24,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:59:24,080 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:24,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-12-14 11:59:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 288. [2022-12-14 11:59:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.3937282229965158) internal successors, (974), 287 states have internal predecessors, (974), 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-12-14 11:59:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 974 transitions. [2022-12-14 11:59:24,086 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 974 transitions. Word has length 24 [2022-12-14 11:59:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:24,086 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 974 transitions. [2022-12-14 11:59:24,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 974 transitions. [2022-12-14 11:59:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:24,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:24,087 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:24,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-14 11:59:24,087 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1387690165, now seen corresponding path program 10 times [2022-12-14 11:59:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:24,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388460161] [2022-12-14 11:59:24,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:24,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:24,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:24,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388460161] [2022-12-14 11:59:24,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388460161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:24,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:24,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951336452] [2022-12-14 11:59:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:24,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:24,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:24,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:24,334 INFO L87 Difference]: Start difference. First operand 288 states and 974 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:24,540 INFO L93 Difference]: Finished difference Result 500 states and 1569 transitions. [2022-12-14 11:59:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:24,542 INFO L225 Difference]: With dead ends: 500 [2022-12-14 11:59:24,542 INFO L226 Difference]: Without dead ends: 494 [2022-12-14 11:59:24,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:24,543 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:24,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-12-14 11:59:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 288. [2022-12-14 11:59:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.3797909407665507) internal successors, (970), 287 states have internal predecessors, (970), 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-12-14 11:59:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 970 transitions. [2022-12-14 11:59:24,548 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 970 transitions. Word has length 24 [2022-12-14 11:59:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:24,548 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 970 transitions. [2022-12-14 11:59:24,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 970 transitions. [2022-12-14 11:59:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:24,548 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:24,548 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:24,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-14 11:59:24,549 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash -801408517, now seen corresponding path program 16 times [2022-12-14 11:59:24,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:24,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746492345] [2022-12-14 11:59:24,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:24,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:24,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746492345] [2022-12-14 11:59:24,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746492345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:24,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:24,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:24,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625600305] [2022-12-14 11:59:24,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:24,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:24,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:24,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:24,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:24,810 INFO L87 Difference]: Start difference. First operand 288 states and 970 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:25,173 INFO L93 Difference]: Finished difference Result 446 states and 1461 transitions. [2022-12-14 11:59:25,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:59:25,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:25,175 INFO L225 Difference]: With dead ends: 446 [2022-12-14 11:59:25,175 INFO L226 Difference]: Without dead ends: 442 [2022-12-14 11:59:25,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:25,176 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:25,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-12-14 11:59:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 284. [2022-12-14 11:59:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.374558303886926) internal successors, (955), 283 states have internal predecessors, (955), 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-12-14 11:59:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 955 transitions. [2022-12-14 11:59:25,180 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 955 transitions. Word has length 24 [2022-12-14 11:59:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:25,181 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 955 transitions. [2022-12-14 11:59:25,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 955 transitions. [2022-12-14 11:59:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:25,181 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:25,181 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:25,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-14 11:59:25,181 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:25,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 512514955, now seen corresponding path program 11 times [2022-12-14 11:59:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:25,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278004553] [2022-12-14 11:59:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:25,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:25,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278004553] [2022-12-14 11:59:25,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278004553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:25,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:25,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127435458] [2022-12-14 11:59:25,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:25,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:25,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:25,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:25,451 INFO L87 Difference]: Start difference. First operand 284 states and 955 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:25,644 INFO L93 Difference]: Finished difference Result 490 states and 1539 transitions. [2022-12-14 11:59:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:25,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:25,645 INFO L225 Difference]: With dead ends: 490 [2022-12-14 11:59:25,645 INFO L226 Difference]: Without dead ends: 490 [2022-12-14 11:59:25,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:25,646 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:25,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:25,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-12-14 11:59:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 286. [2022-12-14 11:59:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 3.375438596491228) internal successors, (962), 285 states have internal predecessors, (962), 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-12-14 11:59:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 962 transitions. [2022-12-14 11:59:25,651 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 962 transitions. Word has length 24 [2022-12-14 11:59:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:25,651 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 962 transitions. [2022-12-14 11:59:25,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 962 transitions. [2022-12-14 11:59:25,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:25,652 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:25,652 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:25,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-14 11:59:25,652 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:25,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash -637736115, now seen corresponding path program 12 times [2022-12-14 11:59:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:25,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069767888] [2022-12-14 11:59:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:25,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:25,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069767888] [2022-12-14 11:59:25,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069767888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:25,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:25,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984063453] [2022-12-14 11:59:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:25,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:25,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:25,897 INFO L87 Difference]: Start difference. First operand 286 states and 962 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:26,129 INFO L93 Difference]: Finished difference Result 468 states and 1489 transitions. [2022-12-14 11:59:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:26,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:26,130 INFO L225 Difference]: With dead ends: 468 [2022-12-14 11:59:26,130 INFO L226 Difference]: Without dead ends: 462 [2022-12-14 11:59:26,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:26,130 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:26,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-12-14 11:59:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 284. [2022-12-14 11:59:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.374558303886926) internal successors, (955), 283 states have internal predecessors, (955), 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-12-14 11:59:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 955 transitions. [2022-12-14 11:59:26,135 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 955 transitions. Word has length 24 [2022-12-14 11:59:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:26,136 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 955 transitions. [2022-12-14 11:59:26,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 955 transitions. [2022-12-14 11:59:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:26,136 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:26,136 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:26,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-14 11:59:26,137 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:26,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:26,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1451003345, now seen corresponding path program 17 times [2022-12-14 11:59:26,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:26,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154142305] [2022-12-14 11:59:26,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:26,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:26,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:26,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154142305] [2022-12-14 11:59:26,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154142305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:26,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:26,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:26,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785904148] [2022-12-14 11:59:26,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:26,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:26,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:26,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:26,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:26,386 INFO L87 Difference]: Start difference. First operand 284 states and 955 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:26,581 INFO L93 Difference]: Finished difference Result 490 states and 1529 transitions. [2022-12-14 11:59:26,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:26,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:26,583 INFO L225 Difference]: With dead ends: 490 [2022-12-14 11:59:26,583 INFO L226 Difference]: Without dead ends: 490 [2022-12-14 11:59:26,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:26,584 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:26,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-12-14 11:59:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 286. [2022-12-14 11:59:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 3.375438596491228) internal successors, (962), 285 states have internal predecessors, (962), 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-12-14 11:59:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 962 transitions. [2022-12-14 11:59:26,589 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 962 transitions. Word has length 24 [2022-12-14 11:59:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:26,589 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 962 transitions. [2022-12-14 11:59:26,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 962 transitions. [2022-12-14 11:59:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:26,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:26,590 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:26,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-14 11:59:26,590 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:26,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash -931260269, now seen corresponding path program 18 times [2022-12-14 11:59:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:26,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098484482] [2022-12-14 11:59:26,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:26,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:26,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098484482] [2022-12-14 11:59:26,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098484482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:26,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:26,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125943040] [2022-12-14 11:59:26,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:26,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:26,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:26,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:26,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:26,841 INFO L87 Difference]: Start difference. First operand 286 states and 962 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:27,124 INFO L93 Difference]: Finished difference Result 428 states and 1404 transitions. [2022-12-14 11:59:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:59:27,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:27,125 INFO L225 Difference]: With dead ends: 428 [2022-12-14 11:59:27,125 INFO L226 Difference]: Without dead ends: 424 [2022-12-14 11:59:27,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:27,126 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:27,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-12-14 11:59:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 286. [2022-12-14 11:59:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 3.3684210526315788) internal successors, (960), 285 states have internal predecessors, (960), 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-12-14 11:59:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 960 transitions. [2022-12-14 11:59:27,132 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 960 transitions. Word has length 24 [2022-12-14 11:59:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:27,133 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 960 transitions. [2022-12-14 11:59:27,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 960 transitions. [2022-12-14 11:59:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:27,133 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:27,133 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:27,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-14 11:59:27,133 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash -140796039, now seen corresponding path program 13 times [2022-12-14 11:59:27,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:27,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003656308] [2022-12-14 11:59:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:27,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:27,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003656308] [2022-12-14 11:59:27,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003656308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:27,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:27,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:27,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305350150] [2022-12-14 11:59:27,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:27,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:27,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:27,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:27,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:27,423 INFO L87 Difference]: Start difference. First operand 286 states and 960 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:27,643 INFO L93 Difference]: Finished difference Result 552 states and 1736 transitions. [2022-12-14 11:59:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:27,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:27,644 INFO L225 Difference]: With dead ends: 552 [2022-12-14 11:59:27,644 INFO L226 Difference]: Without dead ends: 552 [2022-12-14 11:59:27,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:27,645 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:27,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-12-14 11:59:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 292. [2022-12-14 11:59:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3986254295532645) internal successors, (989), 291 states have internal predecessors, (989), 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-12-14 11:59:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 989 transitions. [2022-12-14 11:59:27,650 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 989 transitions. Word has length 24 [2022-12-14 11:59:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:27,650 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 989 transitions. [2022-12-14 11:59:27,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 989 transitions. [2022-12-14 11:59:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:27,651 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:27,651 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:27,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-14 11:59:27,651 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:27,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1469039257, now seen corresponding path program 14 times [2022-12-14 11:59:27,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:27,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461641800] [2022-12-14 11:59:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:27,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:27,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461641800] [2022-12-14 11:59:27,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461641800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:27,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:27,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:27,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166520817] [2022-12-14 11:59:27,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:27,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:27,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:27,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:27,955 INFO L87 Difference]: Start difference. First operand 292 states and 989 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:28,273 INFO L93 Difference]: Finished difference Result 572 states and 1788 transitions. [2022-12-14 11:59:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:59:28,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:28,274 INFO L225 Difference]: With dead ends: 572 [2022-12-14 11:59:28,274 INFO L226 Difference]: Without dead ends: 572 [2022-12-14 11:59:28,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:28,275 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:28,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:28,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-12-14 11:59:28,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 296. [2022-12-14 11:59:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.4271186440677965) internal successors, (1011), 295 states have internal predecessors, (1011), 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-12-14 11:59:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1011 transitions. [2022-12-14 11:59:28,281 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 1011 transitions. Word has length 24 [2022-12-14 11:59:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:28,281 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 1011 transitions. [2022-12-14 11:59:28,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 1011 transitions. [2022-12-14 11:59:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:28,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:28,281 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:28,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-14 11:59:28,282 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:28,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:28,282 INFO L85 PathProgramCache]: Analyzing trace with hash 189839849, now seen corresponding path program 15 times [2022-12-14 11:59:28,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:28,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743641290] [2022-12-14 11:59:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:28,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:28,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743641290] [2022-12-14 11:59:28,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743641290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:28,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:28,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943722789] [2022-12-14 11:59:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:28,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:28,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:28,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:28,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:28,537 INFO L87 Difference]: Start difference. First operand 296 states and 1011 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:28,760 INFO L93 Difference]: Finished difference Result 544 states and 1724 transitions. [2022-12-14 11:59:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:28,762 INFO L225 Difference]: With dead ends: 544 [2022-12-14 11:59:28,762 INFO L226 Difference]: Without dead ends: 544 [2022-12-14 11:59:28,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:28,763 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:28,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-12-14 11:59:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 292. [2022-12-14 11:59:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3986254295532645) internal successors, (989), 291 states have internal predecessors, (989), 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-12-14 11:59:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 989 transitions. [2022-12-14 11:59:28,769 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 989 transitions. Word has length 24 [2022-12-14 11:59:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:28,769 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 989 transitions. [2022-12-14 11:59:28,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 989 transitions. [2022-12-14 11:59:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:28,770 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:28,770 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:28,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-14 11:59:28,770 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1725479237, now seen corresponding path program 16 times [2022-12-14 11:59:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:28,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851614547] [2022-12-14 11:59:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:29,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:29,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851614547] [2022-12-14 11:59:29,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851614547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:29,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:29,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:29,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160926543] [2022-12-14 11:59:29,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:29,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:29,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:29,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:29,020 INFO L87 Difference]: Start difference. First operand 292 states and 989 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:29,260 INFO L93 Difference]: Finished difference Result 576 states and 1805 transitions. [2022-12-14 11:59:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:29,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:29,262 INFO L225 Difference]: With dead ends: 576 [2022-12-14 11:59:29,262 INFO L226 Difference]: Without dead ends: 576 [2022-12-14 11:59:29,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:29,263 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:29,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-12-14 11:59:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 296. [2022-12-14 11:59:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.4033898305084747) internal successors, (1004), 295 states have internal predecessors, (1004), 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-12-14 11:59:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1004 transitions. [2022-12-14 11:59:29,271 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 1004 transitions. Word has length 24 [2022-12-14 11:59:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:29,272 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 1004 transitions. [2022-12-14 11:59:29,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 1004 transitions. [2022-12-14 11:59:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:29,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:29,272 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:29,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-14 11:59:29,272 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:29,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:29,273 INFO L85 PathProgramCache]: Analyzing trace with hash 444375951, now seen corresponding path program 19 times [2022-12-14 11:59:29,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:29,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063864462] [2022-12-14 11:59:29,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:29,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:29,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:29,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063864462] [2022-12-14 11:59:29,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063864462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:29,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:29,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:29,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328059322] [2022-12-14 11:59:29,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:29,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:29,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:29,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:29,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:29,495 INFO L87 Difference]: Start difference. First operand 296 states and 1004 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:29,723 INFO L93 Difference]: Finished difference Result 528 states and 1642 transitions. [2022-12-14 11:59:29,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:29,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:29,725 INFO L225 Difference]: With dead ends: 528 [2022-12-14 11:59:29,725 INFO L226 Difference]: Without dead ends: 520 [2022-12-14 11:59:29,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:29,725 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:29,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-12-14 11:59:29,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 296. [2022-12-14 11:59:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.389830508474576) internal successors, (1000), 295 states have internal predecessors, (1000), 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-12-14 11:59:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1000 transitions. [2022-12-14 11:59:29,731 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 1000 transitions. Word has length 24 [2022-12-14 11:59:29,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:29,731 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 1000 transitions. [2022-12-14 11:59:29,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 1000 transitions. [2022-12-14 11:59:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:29,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:29,731 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:29,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-14 11:59:29,731 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:29,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1976789071, now seen corresponding path program 20 times [2022-12-14 11:59:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:29,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205986398] [2022-12-14 11:59:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:30,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:30,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205986398] [2022-12-14 11:59:30,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205986398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:30,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:30,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247536993] [2022-12-14 11:59:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:30,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:30,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:30,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:30,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:30,023 INFO L87 Difference]: Start difference. First operand 296 states and 1000 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:30,264 INFO L93 Difference]: Finished difference Result 540 states and 1684 transitions. [2022-12-14 11:59:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:30,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:30,266 INFO L225 Difference]: With dead ends: 540 [2022-12-14 11:59:30,266 INFO L226 Difference]: Without dead ends: 540 [2022-12-14 11:59:30,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:30,266 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:30,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-12-14 11:59:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 300. [2022-12-14 11:59:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.408026755852843) internal successors, (1019), 299 states have internal predecessors, (1019), 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-12-14 11:59:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1019 transitions. [2022-12-14 11:59:30,272 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1019 transitions. Word has length 24 [2022-12-14 11:59:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:30,272 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1019 transitions. [2022-12-14 11:59:30,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1019 transitions. [2022-12-14 11:59:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:30,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:30,272 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:30,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-14 11:59:30,273 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:30,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash -201781709, now seen corresponding path program 17 times [2022-12-14 11:59:30,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:30,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508994040] [2022-12-14 11:59:30,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:30,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:30,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:30,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508994040] [2022-12-14 11:59:30,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508994040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:30,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:30,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:30,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344152559] [2022-12-14 11:59:30,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:30,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:30,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:30,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:30,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:30,537 INFO L87 Difference]: Start difference. First operand 300 states and 1019 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:30,738 INFO L93 Difference]: Finished difference Result 562 states and 1757 transitions. [2022-12-14 11:59:30,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:30,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:30,739 INFO L225 Difference]: With dead ends: 562 [2022-12-14 11:59:30,740 INFO L226 Difference]: Without dead ends: 562 [2022-12-14 11:59:30,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:30,740 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:30,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-12-14 11:59:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 300. [2022-12-14 11:59:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.408026755852843) internal successors, (1019), 299 states have internal predecessors, (1019), 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-12-14 11:59:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1019 transitions. [2022-12-14 11:59:30,746 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1019 transitions. Word has length 24 [2022-12-14 11:59:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:30,746 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1019 transitions. [2022-12-14 11:59:30,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1019 transitions. [2022-12-14 11:59:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:30,747 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:30,747 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:30,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-14 11:59:30,747 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash -562549545, now seen corresponding path program 18 times [2022-12-14 11:59:30,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:30,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137499516] [2022-12-14 11:59:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:30,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:31,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137499516] [2022-12-14 11:59:31,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137499516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:31,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:31,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265737595] [2022-12-14 11:59:31,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:31,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:31,027 INFO L87 Difference]: Start difference. First operand 300 states and 1019 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:31,266 INFO L93 Difference]: Finished difference Result 480 states and 1584 transitions. [2022-12-14 11:59:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:59:31,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:31,267 INFO L225 Difference]: With dead ends: 480 [2022-12-14 11:59:31,267 INFO L226 Difference]: Without dead ends: 474 [2022-12-14 11:59:31,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:31,268 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:31,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:31,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-12-14 11:59:31,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 300. [2022-12-14 11:59:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.3946488294314383) internal successors, (1015), 299 states have internal predecessors, (1015), 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-12-14 11:59:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1015 transitions. [2022-12-14 11:59:31,273 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1015 transitions. Word has length 24 [2022-12-14 11:59:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:31,273 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1015 transitions. [2022-12-14 11:59:31,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1015 transitions. [2022-12-14 11:59:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:31,273 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:31,273 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:31,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-14 11:59:31,274 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:31,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1071132835, now seen corresponding path program 21 times [2022-12-14 11:59:31,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:31,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607830665] [2022-12-14 11:59:31,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:31,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:31,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:31,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607830665] [2022-12-14 11:59:31,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607830665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:31,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:31,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:31,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717748530] [2022-12-14 11:59:31,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:31,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:31,511 INFO L87 Difference]: Start difference. First operand 300 states and 1015 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:31,623 INFO L93 Difference]: Finished difference Result 538 states and 1672 transitions. [2022-12-14 11:59:31,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:31,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:31,624 INFO L225 Difference]: With dead ends: 538 [2022-12-14 11:59:31,624 INFO L226 Difference]: Without dead ends: 534 [2022-12-14 11:59:31,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:31,625 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:31,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-12-14 11:59:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 292. [2022-12-14 11:59:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3986254295532645) internal successors, (989), 291 states have internal predecessors, (989), 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-12-14 11:59:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 989 transitions. [2022-12-14 11:59:31,630 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 989 transitions. Word has length 24 [2022-12-14 11:59:31,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:31,630 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 989 transitions. [2022-12-14 11:59:31,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 989 transitions. [2022-12-14 11:59:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:31,631 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:31,631 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:31,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-14 11:59:31,631 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash 139678577, now seen corresponding path program 22 times [2022-12-14 11:59:31,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:31,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736349401] [2022-12-14 11:59:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:31,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:31,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736349401] [2022-12-14 11:59:31,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736349401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:31,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:31,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522924150] [2022-12-14 11:59:31,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:31,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:31,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:31,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:31,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:31,840 INFO L87 Difference]: Start difference. First operand 292 states and 989 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:32,009 INFO L93 Difference]: Finished difference Result 476 states and 1503 transitions. [2022-12-14 11:59:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:32,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:32,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:32,011 INFO L225 Difference]: With dead ends: 476 [2022-12-14 11:59:32,011 INFO L226 Difference]: Without dead ends: 468 [2022-12-14 11:59:32,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:32,011 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:32,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-12-14 11:59:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 294. [2022-12-14 11:59:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3924914675767917) internal successors, (994), 293 states have internal predecessors, (994), 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-12-14 11:59:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 994 transitions. [2022-12-14 11:59:32,018 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 994 transitions. Word has length 24 [2022-12-14 11:59:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:32,018 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 994 transitions. [2022-12-14 11:59:32,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 994 transitions. [2022-12-14 11:59:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:32,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:32,019 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:32,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-14 11:59:32,019 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:32,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash -910588359, now seen corresponding path program 23 times [2022-12-14 11:59:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:32,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604586212] [2022-12-14 11:59:32,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:32,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:32,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:32,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604586212] [2022-12-14 11:59:32,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604586212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:32,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:32,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:32,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830994415] [2022-12-14 11:59:32,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:32,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:32,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:32,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:32,256 INFO L87 Difference]: Start difference. First operand 294 states and 994 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:32,422 INFO L93 Difference]: Finished difference Result 474 states and 1508 transitions. [2022-12-14 11:59:32,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:32,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:32,424 INFO L225 Difference]: With dead ends: 474 [2022-12-14 11:59:32,424 INFO L226 Difference]: Without dead ends: 474 [2022-12-14 11:59:32,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:32,424 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:32,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-12-14 11:59:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 296. [2022-12-14 11:59:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.393220338983051) internal successors, (1001), 295 states have internal predecessors, (1001), 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-12-14 11:59:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1001 transitions. [2022-12-14 11:59:32,429 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 1001 transitions. Word has length 24 [2022-12-14 11:59:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:32,429 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 1001 transitions. [2022-12-14 11:59:32,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 1001 transitions. [2022-12-14 11:59:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:32,430 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:32,430 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:32,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-14 11:59:32,430 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:32,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:32,430 INFO L85 PathProgramCache]: Analyzing trace with hash -390845283, now seen corresponding path program 24 times [2022-12-14 11:59:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:32,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992193431] [2022-12-14 11:59:32,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:32,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:32,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992193431] [2022-12-14 11:59:32,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992193431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:32,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:32,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:32,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478392773] [2022-12-14 11:59:32,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:32,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:32,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:32,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:32,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:32,672 INFO L87 Difference]: Start difference. First operand 296 states and 1001 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:32,949 INFO L93 Difference]: Finished difference Result 462 states and 1486 transitions. [2022-12-14 11:59:32,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:32,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:32,950 INFO L225 Difference]: With dead ends: 462 [2022-12-14 11:59:32,951 INFO L226 Difference]: Without dead ends: 458 [2022-12-14 11:59:32,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:32,951 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:32,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-12-14 11:59:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 294. [2022-12-14 11:59:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3924914675767917) internal successors, (994), 293 states have internal predecessors, (994), 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-12-14 11:59:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 994 transitions. [2022-12-14 11:59:32,956 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 994 transitions. Word has length 24 [2022-12-14 11:59:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:32,956 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 994 transitions. [2022-12-14 11:59:32,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 994 transitions. [2022-12-14 11:59:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:32,956 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:32,956 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:32,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-14 11:59:32,957 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -175325719, now seen corresponding path program 25 times [2022-12-14 11:59:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:32,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281166196] [2022-12-14 11:59:32,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:33,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:33,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281166196] [2022-12-14 11:59:33,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281166196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:33,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:33,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:33,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808897879] [2022-12-14 11:59:33,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:33,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:33,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:33,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:33,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:33,233 INFO L87 Difference]: Start difference. First operand 294 states and 994 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:33,657 INFO L93 Difference]: Finished difference Result 600 states and 1808 transitions. [2022-12-14 11:59:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:59:33,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:33,658 INFO L225 Difference]: With dead ends: 600 [2022-12-14 11:59:33,658 INFO L226 Difference]: Without dead ends: 600 [2022-12-14 11:59:33,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:59:33,659 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:33,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:33,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-12-14 11:59:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 300. [2022-12-14 11:59:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.4414715719063547) internal successors, (1029), 299 states have internal predecessors, (1029), 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-12-14 11:59:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1029 transitions. [2022-12-14 11:59:33,665 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1029 transitions. Word has length 24 [2022-12-14 11:59:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:33,665 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1029 transitions. [2022-12-14 11:59:33,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1029 transitions. [2022-12-14 11:59:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:33,665 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:33,665 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:33,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-14 11:59:33,666 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1608742415, now seen corresponding path program 26 times [2022-12-14 11:59:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:33,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662389684] [2022-12-14 11:59:33,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:33,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:33,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:33,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662389684] [2022-12-14 11:59:33,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662389684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:33,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:33,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45448049] [2022-12-14 11:59:33,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:33,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:33,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:33,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:33,903 INFO L87 Difference]: Start difference. First operand 300 states and 1029 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:34,017 INFO L93 Difference]: Finished difference Result 526 states and 1644 transitions. [2022-12-14 11:59:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:34,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:34,020 INFO L225 Difference]: With dead ends: 526 [2022-12-14 11:59:34,020 INFO L226 Difference]: Without dead ends: 526 [2022-12-14 11:59:34,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:34,020 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:34,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-12-14 11:59:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 296. [2022-12-14 11:59:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.4135593220338984) internal successors, (1007), 295 states have internal predecessors, (1007), 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-12-14 11:59:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1007 transitions. [2022-12-14 11:59:34,026 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 1007 transitions. Word has length 24 [2022-12-14 11:59:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:34,026 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 1007 transitions. [2022-12-14 11:59:34,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 1007 transitions. [2022-12-14 11:59:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:34,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:34,026 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:34,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-14 11:59:34,026 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:34,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash -568352729, now seen corresponding path program 19 times [2022-12-14 11:59:34,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:34,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332965388] [2022-12-14 11:59:34,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:34,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:34,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:34,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332965388] [2022-12-14 11:59:34,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332965388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:34,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:34,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841276574] [2022-12-14 11:59:34,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:34,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:34,324 INFO L87 Difference]: Start difference. First operand 296 states and 1007 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:34,478 INFO L93 Difference]: Finished difference Result 564 states and 1789 transitions. [2022-12-14 11:59:34,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:34,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:34,480 INFO L225 Difference]: With dead ends: 564 [2022-12-14 11:59:34,480 INFO L226 Difference]: Without dead ends: 564 [2022-12-14 11:59:34,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:34,480 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:34,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-12-14 11:59:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 300. [2022-12-14 11:59:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.4414715719063547) internal successors, (1029), 299 states have internal predecessors, (1029), 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-12-14 11:59:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1029 transitions. [2022-12-14 11:59:34,485 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1029 transitions. Word has length 24 [2022-12-14 11:59:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:34,486 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1029 transitions. [2022-12-14 11:59:34,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1029 transitions. [2022-12-14 11:59:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:34,486 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:34,486 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:34,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-14 11:59:34,486 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:34,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:34,487 INFO L85 PathProgramCache]: Analyzing trace with hash -682707995, now seen corresponding path program 20 times [2022-12-14 11:59:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:34,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517496018] [2022-12-14 11:59:34,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:34,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:34,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:34,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517496018] [2022-12-14 11:59:34,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517496018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:34,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:34,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:34,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016311692] [2022-12-14 11:59:34,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:34,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:34,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:34,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:34,715 INFO L87 Difference]: Start difference. First operand 300 states and 1029 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:34,949 INFO L93 Difference]: Finished difference Result 556 states and 1765 transitions. [2022-12-14 11:59:34,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:34,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:34,950 INFO L225 Difference]: With dead ends: 556 [2022-12-14 11:59:34,950 INFO L226 Difference]: Without dead ends: 556 [2022-12-14 11:59:34,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:34,951 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:34,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-12-14 11:59:34,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 296. [2022-12-14 11:59:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.4135593220338984) internal successors, (1007), 295 states have internal predecessors, (1007), 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-12-14 11:59:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1007 transitions. [2022-12-14 11:59:34,957 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 1007 transitions. Word has length 24 [2022-12-14 11:59:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:34,957 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 1007 transitions. [2022-12-14 11:59:34,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 1007 transitions. [2022-12-14 11:59:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:34,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:34,958 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:34,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-14 11:59:34,958 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:34,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1243159547, now seen corresponding path program 27 times [2022-12-14 11:59:34,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:34,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770345391] [2022-12-14 11:59:34,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:34,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:35,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:35,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770345391] [2022-12-14 11:59:35,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770345391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:35,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:35,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:35,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167450108] [2022-12-14 11:59:35,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:35,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:35,229 INFO L87 Difference]: Start difference. First operand 296 states and 1007 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:35,465 INFO L93 Difference]: Finished difference Result 536 states and 1665 transitions. [2022-12-14 11:59:35,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:35,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:35,466 INFO L225 Difference]: With dead ends: 536 [2022-12-14 11:59:35,466 INFO L226 Difference]: Without dead ends: 536 [2022-12-14 11:59:35,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-12-14 11:59:35,466 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:35,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-12-14 11:59:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 300. [2022-12-14 11:59:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.431438127090301) internal successors, (1026), 299 states have internal predecessors, (1026), 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-12-14 11:59:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1026 transitions. [2022-12-14 11:59:35,471 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1026 transitions. Word has length 24 [2022-12-14 11:59:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:35,472 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1026 transitions. [2022-12-14 11:59:35,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1026 transitions. [2022-12-14 11:59:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:35,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:35,472 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:35,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-14 11:59:35,472 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1866397531, now seen corresponding path program 21 times [2022-12-14 11:59:35,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:35,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684156582] [2022-12-14 11:59:35,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:35,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:35,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:35,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684156582] [2022-12-14 11:59:35,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684156582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:35,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:35,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:35,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387719621] [2022-12-14 11:59:35,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:35,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:35,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:35,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:35,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:35,717 INFO L87 Difference]: Start difference. First operand 300 states and 1026 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:35,905 INFO L93 Difference]: Finished difference Result 544 states and 1705 transitions. [2022-12-14 11:59:35,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:35,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:35,907 INFO L225 Difference]: With dead ends: 544 [2022-12-14 11:59:35,907 INFO L226 Difference]: Without dead ends: 544 [2022-12-14 11:59:35,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:35,907 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:35,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-12-14 11:59:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 300. [2022-12-14 11:59:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.431438127090301) internal successors, (1026), 299 states have internal predecessors, (1026), 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-12-14 11:59:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1026 transitions. [2022-12-14 11:59:35,913 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1026 transitions. Word has length 24 [2022-12-14 11:59:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:35,913 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1026 transitions. [2022-12-14 11:59:35,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1026 transitions. [2022-12-14 11:59:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:35,913 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:35,913 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:35,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-14 11:59:35,914 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:35,914 INFO L85 PathProgramCache]: Analyzing trace with hash 644220353, now seen corresponding path program 22 times [2022-12-14 11:59:35,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:35,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274352008] [2022-12-14 11:59:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:36,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274352008] [2022-12-14 11:59:36,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274352008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:36,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:36,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497688827] [2022-12-14 11:59:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:36,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:36,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:36,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:36,170 INFO L87 Difference]: Start difference. First operand 300 states and 1026 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:36,432 INFO L93 Difference]: Finished difference Result 470 states and 1546 transitions. [2022-12-14 11:59:36,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:59:36,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:36,434 INFO L225 Difference]: With dead ends: 470 [2022-12-14 11:59:36,434 INFO L226 Difference]: Without dead ends: 464 [2022-12-14 11:59:36,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:36,434 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:36,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-12-14 11:59:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 300. [2022-12-14 11:59:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.4180602006688963) internal successors, (1022), 299 states have internal predecessors, (1022), 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-12-14 11:59:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1022 transitions. [2022-12-14 11:59:36,439 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1022 transitions. Word has length 24 [2022-12-14 11:59:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:36,439 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1022 transitions. [2022-12-14 11:59:36,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1022 transitions. [2022-12-14 11:59:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:36,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:36,440 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:36,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-14 11:59:36,440 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1230502001, now seen corresponding path program 28 times [2022-12-14 11:59:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:36,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978688360] [2022-12-14 11:59:36,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:36,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:36,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978688360] [2022-12-14 11:59:36,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978688360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:36,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:36,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:36,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029459598] [2022-12-14 11:59:36,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:36,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:36,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:36,684 INFO L87 Difference]: Start difference. First operand 300 states and 1022 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:36,946 INFO L93 Difference]: Finished difference Result 508 states and 1594 transitions. [2022-12-14 11:59:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:36,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:36,947 INFO L225 Difference]: With dead ends: 508 [2022-12-14 11:59:36,947 INFO L226 Difference]: Without dead ends: 504 [2022-12-14 11:59:36,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:36,947 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:36,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:36,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-12-14 11:59:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 296. [2022-12-14 11:59:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.4135593220338984) internal successors, (1007), 295 states have internal predecessors, (1007), 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-12-14 11:59:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1007 transitions. [2022-12-14 11:59:36,952 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 1007 transitions. Word has length 24 [2022-12-14 11:59:36,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:36,953 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 1007 transitions. [2022-12-14 11:59:36,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 1007 transitions. [2022-12-14 11:59:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:36,954 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:36,954 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:36,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-14 11:59:36,954 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:36,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:36,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1750541823, now seen corresponding path program 23 times [2022-12-14 11:59:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:36,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266502763] [2022-12-14 11:59:36,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:36,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:37,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:37,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266502763] [2022-12-14 11:59:37,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266502763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:37,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:37,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:37,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707612944] [2022-12-14 11:59:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:37,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:37,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:37,232 INFO L87 Difference]: Start difference. First operand 296 states and 1007 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:37,472 INFO L93 Difference]: Finished difference Result 504 states and 1599 transitions. [2022-12-14 11:59:37,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:59:37,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:37,473 INFO L225 Difference]: With dead ends: 504 [2022-12-14 11:59:37,473 INFO L226 Difference]: Without dead ends: 504 [2022-12-14 11:59:37,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:37,474 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:37,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-12-14 11:59:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 298. [2022-12-14 11:59:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.414141414141414) internal successors, (1014), 297 states have internal predecessors, (1014), 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-12-14 11:59:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1014 transitions. [2022-12-14 11:59:37,479 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 1014 transitions. Word has length 24 [2022-12-14 11:59:37,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:37,479 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 1014 transitions. [2022-12-14 11:59:37,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:37,479 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 1014 transitions. [2022-12-14 11:59:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:37,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:37,479 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:37,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-14 11:59:37,480 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1394174403, now seen corresponding path program 24 times [2022-12-14 11:59:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:37,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163358113] [2022-12-14 11:59:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:37,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:37,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163358113] [2022-12-14 11:59:37,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163358113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:37,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:37,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:37,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168683560] [2022-12-14 11:59:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:37,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:37,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:37,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:37,719 INFO L87 Difference]: Start difference. First operand 298 states and 1014 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:38,027 INFO L93 Difference]: Finished difference Result 448 states and 1475 transitions. [2022-12-14 11:59:38,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:59:38,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:38,028 INFO L225 Difference]: With dead ends: 448 [2022-12-14 11:59:38,028 INFO L226 Difference]: Without dead ends: 442 [2022-12-14 11:59:38,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:38,028 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:38,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:38,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-12-14 11:59:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 296. [2022-12-14 11:59:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.4135593220338984) internal successors, (1007), 295 states have internal predecessors, (1007), 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-12-14 11:59:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1007 transitions. [2022-12-14 11:59:38,035 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 1007 transitions. Word has length 24 [2022-12-14 11:59:38,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:38,035 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 1007 transitions. [2022-12-14 11:59:38,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 1007 transitions. [2022-12-14 11:59:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:38,036 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:38,036 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:38,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-14 11:59:38,036 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash 580907173, now seen corresponding path program 29 times [2022-12-14 11:59:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:38,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464672353] [2022-12-14 11:59:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:38,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464672353] [2022-12-14 11:59:38,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464672353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:38,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:38,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:38,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162552375] [2022-12-14 11:59:38,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:38,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:38,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:38,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:38,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:38,287 INFO L87 Difference]: Start difference. First operand 296 states and 1007 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:38,480 INFO L93 Difference]: Finished difference Result 498 states and 1564 transitions. [2022-12-14 11:59:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:38,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:38,481 INFO L225 Difference]: With dead ends: 498 [2022-12-14 11:59:38,481 INFO L226 Difference]: Without dead ends: 498 [2022-12-14 11:59:38,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:38,481 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:38,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:38,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-12-14 11:59:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 298. [2022-12-14 11:59:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.414141414141414) internal successors, (1014), 297 states have internal predecessors, (1014), 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-12-14 11:59:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1014 transitions. [2022-12-14 11:59:38,486 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 1014 transitions. Word has length 24 [2022-12-14 11:59:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:38,487 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 1014 transitions. [2022-12-14 11:59:38,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 1014 transitions. [2022-12-14 11:59:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:38,487 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:38,487 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:38,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-14 11:59:38,487 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:38,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:38,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1100650249, now seen corresponding path program 30 times [2022-12-14 11:59:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:38,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922267113] [2022-12-14 11:59:38,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:38,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:38,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:38,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922267113] [2022-12-14 11:59:38,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922267113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:38,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:38,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:38,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109390979] [2022-12-14 11:59:38,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:38,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:38,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:38,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:38,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:38,718 INFO L87 Difference]: Start difference. First operand 298 states and 1014 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:38,894 INFO L93 Difference]: Finished difference Result 478 states and 1522 transitions. [2022-12-14 11:59:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:38,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:38,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:38,895 INFO L225 Difference]: With dead ends: 478 [2022-12-14 11:59:38,895 INFO L226 Difference]: Without dead ends: 474 [2022-12-14 11:59:38,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:38,895 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:38,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-12-14 11:59:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 294. [2022-12-14 11:59:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3924914675767917) internal successors, (994), 293 states have internal predecessors, (994), 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-12-14 11:59:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 994 transitions. [2022-12-14 11:59:38,900 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 994 transitions. Word has length 24 [2022-12-14 11:59:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:38,900 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 994 transitions. [2022-12-14 11:59:38,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 994 transitions. [2022-12-14 11:59:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:38,901 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:38,901 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:38,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-14 11:59:38,901 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:38,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1572447083, now seen corresponding path program 31 times [2022-12-14 11:59:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:38,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021602674] [2022-12-14 11:59:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:39,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:39,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021602674] [2022-12-14 11:59:39,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021602674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:39,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:39,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:39,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725997135] [2022-12-14 11:59:39,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:39,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:39,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:39,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:39,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:39,101 INFO L87 Difference]: Start difference. First operand 294 states and 994 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:39,263 INFO L93 Difference]: Finished difference Result 418 states and 1357 transitions. [2022-12-14 11:59:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:39,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:39,264 INFO L225 Difference]: With dead ends: 418 [2022-12-14 11:59:39,264 INFO L226 Difference]: Without dead ends: 418 [2022-12-14 11:59:39,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:39,264 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:39,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-12-14 11:59:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 302. [2022-12-14 11:59:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.4152823920265782) internal successors, (1028), 301 states have internal predecessors, (1028), 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-12-14 11:59:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1028 transitions. [2022-12-14 11:59:39,269 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 1028 transitions. Word has length 24 [2022-12-14 11:59:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:39,269 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 1028 transitions. [2022-12-14 11:59:39,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 1028 transitions. [2022-12-14 11:59:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:39,270 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:39,270 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:39,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-14 11:59:39,270 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1124267021, now seen corresponding path program 32 times [2022-12-14 11:59:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:39,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281762121] [2022-12-14 11:59:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:39,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:39,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281762121] [2022-12-14 11:59:39,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281762121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:39,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:39,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:39,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306387566] [2022-12-14 11:59:39,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:39,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:39,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:39,483 INFO L87 Difference]: Start difference. First operand 302 states and 1028 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:39,750 INFO L93 Difference]: Finished difference Result 440 states and 1401 transitions. [2022-12-14 11:59:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:39,751 INFO L225 Difference]: With dead ends: 440 [2022-12-14 11:59:39,751 INFO L226 Difference]: Without dead ends: 440 [2022-12-14 11:59:39,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:39,751 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:39,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-12-14 11:59:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 300. [2022-12-14 11:59:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.4381270903010033) internal successors, (1028), 299 states have internal predecessors, (1028), 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-12-14 11:59:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1028 transitions. [2022-12-14 11:59:39,756 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1028 transitions. Word has length 24 [2022-12-14 11:59:39,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:39,757 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1028 transitions. [2022-12-14 11:59:39,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1028 transitions. [2022-12-14 11:59:39,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:39,757 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:39,757 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:39,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-14 11:59:39,757 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:39,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:39,758 INFO L85 PathProgramCache]: Analyzing trace with hash -960692567, now seen corresponding path program 33 times [2022-12-14 11:59:39,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:39,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132661426] [2022-12-14 11:59:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:39,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:39,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132661426] [2022-12-14 11:59:39,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132661426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:39,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:39,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:39,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016921513] [2022-12-14 11:59:39,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:39,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:39,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:39,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:39,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:39,967 INFO L87 Difference]: Start difference. First operand 300 states and 1028 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:40,247 INFO L93 Difference]: Finished difference Result 420 states and 1390 transitions. [2022-12-14 11:59:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:40,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:40,248 INFO L225 Difference]: With dead ends: 420 [2022-12-14 11:59:40,248 INFO L226 Difference]: Without dead ends: 420 [2022-12-14 11:59:40,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:40,249 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:40,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-12-14 11:59:40,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 308. [2022-12-14 11:59:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.439739413680782) internal successors, (1056), 307 states have internal predecessors, (1056), 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-12-14 11:59:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1056 transitions. [2022-12-14 11:59:40,254 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1056 transitions. Word has length 24 [2022-12-14 11:59:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:40,254 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 1056 transitions. [2022-12-14 11:59:40,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1056 transitions. [2022-12-14 11:59:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:40,255 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:40,255 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:40,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-14 11:59:40,255 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash 378252675, now seen corresponding path program 34 times [2022-12-14 11:59:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:40,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138372786] [2022-12-14 11:59:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:40,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:40,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138372786] [2022-12-14 11:59:40,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138372786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:40,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:40,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:40,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29171524] [2022-12-14 11:59:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:40,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:40,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:40,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:40,465 INFO L87 Difference]: Start difference. First operand 308 states and 1056 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:40,706 INFO L93 Difference]: Finished difference Result 450 states and 1470 transitions. [2022-12-14 11:59:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:40,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:40,707 INFO L225 Difference]: With dead ends: 450 [2022-12-14 11:59:40,707 INFO L226 Difference]: Without dead ends: 450 [2022-12-14 11:59:40,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:40,707 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:40,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-12-14 11:59:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 312. [2022-12-14 11:59:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 3.4662379421221865) internal successors, (1078), 311 states have internal predecessors, (1078), 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-12-14 11:59:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 1078 transitions. [2022-12-14 11:59:40,713 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 1078 transitions. Word has length 24 [2022-12-14 11:59:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:40,713 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 1078 transitions. [2022-12-14 11:59:40,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 1078 transitions. [2022-12-14 11:59:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:40,714 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:40,714 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:40,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-14 11:59:40,714 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:40,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2018291221, now seen corresponding path program 35 times [2022-12-14 11:59:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:40,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675594825] [2022-12-14 11:59:40,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:40,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:40,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:40,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675594825] [2022-12-14 11:59:40,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675594825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:40,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:40,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:40,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697528425] [2022-12-14 11:59:40,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:40,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:40,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:40,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:40,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:40,933 INFO L87 Difference]: Start difference. First operand 312 states and 1078 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:41,213 INFO L93 Difference]: Finished difference Result 438 states and 1448 transitions. [2022-12-14 11:59:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:41,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:41,214 INFO L225 Difference]: With dead ends: 438 [2022-12-14 11:59:41,214 INFO L226 Difference]: Without dead ends: 438 [2022-12-14 11:59:41,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:41,214 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:41,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-12-14 11:59:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 308. [2022-12-14 11:59:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.439739413680782) internal successors, (1056), 307 states have internal predecessors, (1056), 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-12-14 11:59:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1056 transitions. [2022-12-14 11:59:41,219 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1056 transitions. Word has length 24 [2022-12-14 11:59:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:41,219 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 1056 transitions. [2022-12-14 11:59:41,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1056 transitions. [2022-12-14 11:59:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:41,220 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:41,220 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:41,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-14 11:59:41,220 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:41,220 INFO L85 PathProgramCache]: Analyzing trace with hash -313892569, now seen corresponding path program 36 times [2022-12-14 11:59:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:41,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916523630] [2022-12-14 11:59:41,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:41,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:41,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916523630] [2022-12-14 11:59:41,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916523630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:41,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:41,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345196026] [2022-12-14 11:59:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:41,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:41,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:41,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:41,447 INFO L87 Difference]: Start difference. First operand 308 states and 1056 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:41,667 INFO L93 Difference]: Finished difference Result 444 states and 1441 transitions. [2022-12-14 11:59:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:41,668 INFO L225 Difference]: With dead ends: 444 [2022-12-14 11:59:41,669 INFO L226 Difference]: Without dead ends: 444 [2022-12-14 11:59:41,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:41,669 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:41,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-12-14 11:59:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 302. [2022-12-14 11:59:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.395348837209302) internal successors, (1022), 301 states have internal predecessors, (1022), 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-12-14 11:59:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1022 transitions. [2022-12-14 11:59:41,674 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 1022 transitions. Word has length 24 [2022-12-14 11:59:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:41,674 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 1022 transitions. [2022-12-14 11:59:41,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 1022 transitions. [2022-12-14 11:59:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:41,675 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:41,675 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:41,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-14 11:59:41,675 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:41,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:41,675 INFO L85 PathProgramCache]: Analyzing trace with hash -257892063, now seen corresponding path program 25 times [2022-12-14 11:59:41,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:41,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026409964] [2022-12-14 11:59:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:41,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:41,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:41,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026409964] [2022-12-14 11:59:41,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026409964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:41,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:41,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209275489] [2022-12-14 11:59:41,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:41,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:41,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:41,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:41,907 INFO L87 Difference]: Start difference. First operand 302 states and 1022 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:42,127 INFO L93 Difference]: Finished difference Result 400 states and 1254 transitions. [2022-12-14 11:59:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:42,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:42,128 INFO L225 Difference]: With dead ends: 400 [2022-12-14 11:59:42,128 INFO L226 Difference]: Without dead ends: 386 [2022-12-14 11:59:42,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:42,129 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:42,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-12-14 11:59:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 306. [2022-12-14 11:59:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.380327868852459) internal successors, (1031), 305 states have internal predecessors, (1031), 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-12-14 11:59:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 1031 transitions. [2022-12-14 11:59:42,134 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 1031 transitions. Word has length 24 [2022-12-14 11:59:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:42,134 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 1031 transitions. [2022-12-14 11:59:42,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 1031 transitions. [2022-12-14 11:59:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:42,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:42,135 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:42,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-14 11:59:42,135 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:42,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:42,135 INFO L85 PathProgramCache]: Analyzing trace with hash -231869987, now seen corresponding path program 26 times [2022-12-14 11:59:42,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:42,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497590135] [2022-12-14 11:59:42,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:42,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:42,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:42,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497590135] [2022-12-14 11:59:42,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497590135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:42,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:42,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:42,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586798700] [2022-12-14 11:59:42,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:42,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:42,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:42,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:42,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:42,361 INFO L87 Difference]: Start difference. First operand 306 states and 1031 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:42,470 INFO L93 Difference]: Finished difference Result 422 states and 1296 transitions. [2022-12-14 11:59:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:42,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:42,471 INFO L225 Difference]: With dead ends: 422 [2022-12-14 11:59:42,471 INFO L226 Difference]: Without dead ends: 422 [2022-12-14 11:59:42,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:42,471 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:42,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-12-14 11:59:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 308. [2022-12-14 11:59:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.3811074918566777) internal successors, (1038), 307 states have internal predecessors, (1038), 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-12-14 11:59:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1038 transitions. [2022-12-14 11:59:42,477 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1038 transitions. Word has length 24 [2022-12-14 11:59:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:42,477 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 1038 transitions. [2022-12-14 11:59:42,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1038 transitions. [2022-12-14 11:59:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:42,477 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:42,478 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:42,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-14 11:59:42,478 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:42,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:42,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1382121057, now seen corresponding path program 27 times [2022-12-14 11:59:42,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:42,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827100407] [2022-12-14 11:59:42,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:42,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:42,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827100407] [2022-12-14 11:59:42,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827100407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:42,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:42,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098874081] [2022-12-14 11:59:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:42,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:42,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:42,688 INFO L87 Difference]: Start difference. First operand 308 states and 1038 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:42,887 INFO L93 Difference]: Finished difference Result 398 states and 1254 transitions. [2022-12-14 11:59:42,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:42,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:42,888 INFO L225 Difference]: With dead ends: 398 [2022-12-14 11:59:42,888 INFO L226 Difference]: Without dead ends: 392 [2022-12-14 11:59:42,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:42,888 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:42,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-12-14 11:59:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 302. [2022-12-14 11:59:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.395348837209302) internal successors, (1022), 301 states have internal predecessors, (1022), 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-12-14 11:59:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1022 transitions. [2022-12-14 11:59:42,896 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 1022 transitions. Word has length 24 [2022-12-14 11:59:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:42,896 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 1022 transitions. [2022-12-14 11:59:42,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 1022 transitions. [2022-12-14 11:59:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:42,897 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:42,897 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:42,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-14 11:59:42,897 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:42,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash 28341977, now seen corresponding path program 28 times [2022-12-14 11:59:42,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:42,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707987621] [2022-12-14 11:59:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:43,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:43,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707987621] [2022-12-14 11:59:43,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707987621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:43,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:43,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:43,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098758029] [2022-12-14 11:59:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:43,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:43,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:43,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:43,170 INFO L87 Difference]: Start difference. First operand 302 states and 1022 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:43,486 INFO L93 Difference]: Finished difference Result 398 states and 1263 transitions. [2022-12-14 11:59:43,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:59:43,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:43,488 INFO L225 Difference]: With dead ends: 398 [2022-12-14 11:59:43,488 INFO L226 Difference]: Without dead ends: 398 [2022-12-14 11:59:43,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:59:43,488 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:43,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-12-14 11:59:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 306. [2022-12-14 11:59:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.3901639344262295) internal successors, (1034), 305 states have internal predecessors, (1034), 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-12-14 11:59:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 1034 transitions. [2022-12-14 11:59:43,492 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 1034 transitions. Word has length 24 [2022-12-14 11:59:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:43,493 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 1034 transitions. [2022-12-14 11:59:43,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 1034 transitions. [2022-12-14 11:59:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:43,493 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:43,493 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:43,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-14 11:59:43,493 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:43,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:43,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1883478233, now seen corresponding path program 29 times [2022-12-14 11:59:43,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:43,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021926111] [2022-12-14 11:59:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:43,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:43,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:43,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021926111] [2022-12-14 11:59:43,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021926111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:43,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:43,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118572433] [2022-12-14 11:59:43,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:43,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:43,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:43,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:43,745 INFO L87 Difference]: Start difference. First operand 306 states and 1034 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:44,150 INFO L93 Difference]: Finished difference Result 464 states and 1413 transitions. [2022-12-14 11:59:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 11:59:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:44,151 INFO L225 Difference]: With dead ends: 464 [2022-12-14 11:59:44,151 INFO L226 Difference]: Without dead ends: 464 [2022-12-14 11:59:44,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:59:44,151 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:44,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:44,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-12-14 11:59:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 308. [2022-12-14 11:59:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.3908794788273617) internal successors, (1041), 307 states have internal predecessors, (1041), 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-12-14 11:59:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1041 transitions. [2022-12-14 11:59:44,157 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1041 transitions. Word has length 24 [2022-12-14 11:59:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:44,157 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 1041 transitions. [2022-12-14 11:59:44,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1041 transitions. [2022-12-14 11:59:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:44,157 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:44,157 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:44,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-14 11:59:44,158 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:44,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1261237993, now seen corresponding path program 30 times [2022-12-14 11:59:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:44,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260422411] [2022-12-14 11:59:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:44,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:44,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260422411] [2022-12-14 11:59:44,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260422411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:44,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:44,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:44,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979227857] [2022-12-14 11:59:44,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:44,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:44,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:44,374 INFO L87 Difference]: Start difference. First operand 308 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:44,477 INFO L93 Difference]: Finished difference Result 406 states and 1275 transitions. [2022-12-14 11:59:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:44,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:44,478 INFO L225 Difference]: With dead ends: 406 [2022-12-14 11:59:44,478 INFO L226 Difference]: Without dead ends: 400 [2022-12-14 11:59:44,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:44,478 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:44,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:44,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-12-14 11:59:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 306. [2022-12-14 11:59:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.3901639344262295) internal successors, (1034), 305 states have internal predecessors, (1034), 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-12-14 11:59:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 1034 transitions. [2022-12-14 11:59:44,483 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 1034 transitions. Word has length 24 [2022-12-14 11:59:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:44,483 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 1034 transitions. [2022-12-14 11:59:44,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 1034 transitions. [2022-12-14 11:59:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:44,483 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:44,483 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:44,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-14 11:59:44,484 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash -349564423, now seen corresponding path program 37 times [2022-12-14 11:59:44,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:44,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313057866] [2022-12-14 11:59:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:44,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:44,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313057866] [2022-12-14 11:59:44,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313057866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:44,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:44,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:44,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739653088] [2022-12-14 11:59:44,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:44,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:44,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:44,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:44,744 INFO L87 Difference]: Start difference. First operand 306 states and 1034 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:45,011 INFO L93 Difference]: Finished difference Result 572 states and 1808 transitions. [2022-12-14 11:59:45,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:45,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:45,012 INFO L225 Difference]: With dead ends: 572 [2022-12-14 11:59:45,012 INFO L226 Difference]: Without dead ends: 572 [2022-12-14 11:59:45,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:45,012 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:45,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-12-14 11:59:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 306. [2022-12-14 11:59:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.3901639344262295) internal successors, (1034), 305 states have internal predecessors, (1034), 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-12-14 11:59:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 1034 transitions. [2022-12-14 11:59:45,018 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 1034 transitions. Word has length 24 [2022-12-14 11:59:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:45,018 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 1034 transitions. [2022-12-14 11:59:45,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 1034 transitions. [2022-12-14 11:59:45,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:45,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:45,018 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:45,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-14 11:59:45,019 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1502178229, now seen corresponding path program 38 times [2022-12-14 11:59:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:45,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527518132] [2022-12-14 11:59:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:45,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:45,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:45,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527518132] [2022-12-14 11:59:45,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527518132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:45,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:45,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493128141] [2022-12-14 11:59:45,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:45,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:45,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:45,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:45,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:45,251 INFO L87 Difference]: Start difference. First operand 306 states and 1034 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:45,412 INFO L93 Difference]: Finished difference Result 570 states and 1821 transitions. [2022-12-14 11:59:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:45,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:45,413 INFO L225 Difference]: With dead ends: 570 [2022-12-14 11:59:45,413 INFO L226 Difference]: Without dead ends: 570 [2022-12-14 11:59:45,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:45,414 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:45,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-12-14 11:59:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 304. [2022-12-14 11:59:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.4125412541254128) internal successors, (1034), 303 states have internal predecessors, (1034), 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-12-14 11:59:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1034 transitions. [2022-12-14 11:59:45,419 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1034 transitions. Word has length 24 [2022-12-14 11:59:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:45,419 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 1034 transitions. [2022-12-14 11:59:45,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1034 transitions. [2022-12-14 11:59:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:45,420 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:45,420 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:45,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-14 11:59:45,420 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1373951625, now seen corresponding path program 39 times [2022-12-14 11:59:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:45,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553168423] [2022-12-14 11:59:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:45,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:45,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553168423] [2022-12-14 11:59:45,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553168423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:45,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:45,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139224827] [2022-12-14 11:59:45,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:45,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:45,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:45,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:45,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:45,643 INFO L87 Difference]: Start difference. First operand 304 states and 1034 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:45,778 INFO L93 Difference]: Finished difference Result 532 states and 1727 transitions. [2022-12-14 11:59:45,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:45,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:45,779 INFO L225 Difference]: With dead ends: 532 [2022-12-14 11:59:45,779 INFO L226 Difference]: Without dead ends: 532 [2022-12-14 11:59:45,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:45,779 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:45,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-12-14 11:59:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 298. [2022-12-14 11:59:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.367003367003367) internal successors, (1000), 297 states have internal predecessors, (1000), 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-12-14 11:59:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1000 transitions. [2022-12-14 11:59:45,785 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 1000 transitions. Word has length 24 [2022-12-14 11:59:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:45,785 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 1000 transitions. [2022-12-14 11:59:45,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 1000 transitions. [2022-12-14 11:59:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:45,785 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:45,785 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:45,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-14 11:59:45,785 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash 126601749, now seen corresponding path program 40 times [2022-12-14 11:59:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:45,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319397219] [2022-12-14 11:59:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:46,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:46,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319397219] [2022-12-14 11:59:46,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319397219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:46,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:46,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145348109] [2022-12-14 11:59:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:46,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:46,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:46,036 INFO L87 Difference]: Start difference. First operand 298 states and 1000 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:46,243 INFO L93 Difference]: Finished difference Result 480 states and 1524 transitions. [2022-12-14 11:59:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:46,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:46,244 INFO L225 Difference]: With dead ends: 480 [2022-12-14 11:59:46,244 INFO L226 Difference]: Without dead ends: 480 [2022-12-14 11:59:46,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:46,245 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:46,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-12-14 11:59:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 304. [2022-12-14 11:59:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.3696369636963697) internal successors, (1021), 303 states have internal predecessors, (1021), 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-12-14 11:59:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1021 transitions. [2022-12-14 11:59:46,249 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1021 transitions. Word has length 24 [2022-12-14 11:59:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:46,249 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 1021 transitions. [2022-12-14 11:59:46,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1021 transitions. [2022-12-14 11:59:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:46,250 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:46,250 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:46,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-14 11:59:46,250 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:46,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:46,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1793824397, now seen corresponding path program 31 times [2022-12-14 11:59:46,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:46,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756861833] [2022-12-14 11:59:46,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:46,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:46,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:46,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756861833] [2022-12-14 11:59:46,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756861833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:46,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:46,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115356227] [2022-12-14 11:59:46,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:46,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:46,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:46,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:46,491 INFO L87 Difference]: Start difference. First operand 304 states and 1021 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:46,701 INFO L93 Difference]: Finished difference Result 474 states and 1433 transitions. [2022-12-14 11:59:46,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:46,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:46,702 INFO L225 Difference]: With dead ends: 474 [2022-12-14 11:59:46,703 INFO L226 Difference]: Without dead ends: 460 [2022-12-14 11:59:46,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:46,703 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:46,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-12-14 11:59:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 304. [2022-12-14 11:59:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.34983498349835) internal successors, (1015), 303 states have internal predecessors, (1015), 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-12-14 11:59:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1015 transitions. [2022-12-14 11:59:46,708 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1015 transitions. Word has length 24 [2022-12-14 11:59:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:46,708 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 1015 transitions. [2022-12-14 11:59:46,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1015 transitions. [2022-12-14 11:59:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:46,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:46,709 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:46,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-14 11:59:46,709 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1413764789, now seen corresponding path program 41 times [2022-12-14 11:59:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:46,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069400193] [2022-12-14 11:59:46,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:46,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:46,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069400193] [2022-12-14 11:59:46,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069400193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:46,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:46,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:59:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587413435] [2022-12-14 11:59:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:46,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:59:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:46,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:59:46,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:46,960 INFO L87 Difference]: Start difference. First operand 304 states and 1015 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:47,377 INFO L93 Difference]: Finished difference Result 492 states and 1531 transitions. [2022-12-14 11:59:47,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:59:47,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:47,378 INFO L225 Difference]: With dead ends: 492 [2022-12-14 11:59:47,378 INFO L226 Difference]: Without dead ends: 492 [2022-12-14 11:59:47,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:59:47,379 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:47,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-12-14 11:59:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 308. [2022-12-14 11:59:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.3680781758957656) internal successors, (1034), 307 states have internal predecessors, (1034), 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-12-14 11:59:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1034 transitions. [2022-12-14 11:59:47,384 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1034 transitions. Word has length 24 [2022-12-14 11:59:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:47,384 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 1034 transitions. [2022-12-14 11:59:47,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1034 transitions. [2022-12-14 11:59:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:47,385 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:47,385 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:47,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-14 11:59:47,385 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash 361242573, now seen corresponding path program 32 times [2022-12-14 11:59:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:47,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74785559] [2022-12-14 11:59:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:47,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:47,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74785559] [2022-12-14 11:59:47,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74785559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:47,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:47,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178119186] [2022-12-14 11:59:47,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:47,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:47,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:47,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:47,594 INFO L87 Difference]: Start difference. First operand 308 states and 1034 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:47,755 INFO L93 Difference]: Finished difference Result 520 states and 1567 transitions. [2022-12-14 11:59:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:59:47,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:47,757 INFO L225 Difference]: With dead ends: 520 [2022-12-14 11:59:47,757 INFO L226 Difference]: Without dead ends: 520 [2022-12-14 11:59:47,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:47,757 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:47,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:47,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-12-14 11:59:47,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 308. [2022-12-14 11:59:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.3680781758957656) internal successors, (1034), 307 states have internal predecessors, (1034), 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-12-14 11:59:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1034 transitions. [2022-12-14 11:59:47,762 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1034 transitions. Word has length 24 [2022-12-14 11:59:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:47,762 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 1034 transitions. [2022-12-14 11:59:47,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1034 transitions. [2022-12-14 11:59:47,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:47,763 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:47,763 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:47,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-14 11:59:47,763 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:47,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash 474737, now seen corresponding path program 33 times [2022-12-14 11:59:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:47,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591393826] [2022-12-14 11:59:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:47,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:47,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:47,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591393826] [2022-12-14 11:59:47,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591393826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:47,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:47,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944362494] [2022-12-14 11:59:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:47,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:47,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:47,984 INFO L87 Difference]: Start difference. First operand 308 states and 1034 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:48,163 INFO L93 Difference]: Finished difference Result 470 states and 1448 transitions. [2022-12-14 11:59:48,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:48,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:48,164 INFO L225 Difference]: With dead ends: 470 [2022-12-14 11:59:48,164 INFO L226 Difference]: Without dead ends: 464 [2022-12-14 11:59:48,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:48,165 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:48,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-12-14 11:59:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 308. [2022-12-14 11:59:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.3550488599348536) internal successors, (1030), 307 states have internal predecessors, (1030), 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-12-14 11:59:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1030 transitions. [2022-12-14 11:59:48,170 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1030 transitions. Word has length 24 [2022-12-14 11:59:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:48,170 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 1030 transitions. [2022-12-14 11:59:48,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1030 transitions. [2022-12-14 11:59:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:48,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:48,170 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:48,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-14 11:59:48,170 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1634157117, now seen corresponding path program 42 times [2022-12-14 11:59:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:48,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233917428] [2022-12-14 11:59:48,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:48,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:48,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:48,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233917428] [2022-12-14 11:59:48,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233917428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:48,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:48,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:48,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321563665] [2022-12-14 11:59:48,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:48,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:48,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:48,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:48,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:48,419 INFO L87 Difference]: Start difference. First operand 308 states and 1030 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:48,545 INFO L93 Difference]: Finished difference Result 362 states and 1238 transitions. [2022-12-14 11:59:48,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:48,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:48,546 INFO L225 Difference]: With dead ends: 362 [2022-12-14 11:59:48,546 INFO L226 Difference]: Without dead ends: 358 [2022-12-14 11:59:48,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:59:48,547 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:48,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:48,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-12-14 11:59:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 298. [2022-12-14 11:59:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.367003367003367) internal successors, (1000), 297 states have internal predecessors, (1000), 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-12-14 11:59:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1000 transitions. [2022-12-14 11:59:48,551 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 1000 transitions. Word has length 24 [2022-12-14 11:59:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:48,551 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 1000 transitions. [2022-12-14 11:59:48,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 1000 transitions. [2022-12-14 11:59:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:48,552 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:48,552 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:48,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-14 11:59:48,552 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1369513161, now seen corresponding path program 34 times [2022-12-14 11:59:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:48,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237462637] [2022-12-14 11:59:48,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:48,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:48,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237462637] [2022-12-14 11:59:48,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237462637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:48,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:48,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058684445] [2022-12-14 11:59:48,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:48,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:48,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:48,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:48,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:48,762 INFO L87 Difference]: Start difference. First operand 298 states and 1000 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:48,923 INFO L93 Difference]: Finished difference Result 492 states and 1489 transitions. [2022-12-14 11:59:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:48,924 INFO L225 Difference]: With dead ends: 492 [2022-12-14 11:59:48,924 INFO L226 Difference]: Without dead ends: 478 [2022-12-14 11:59:48,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:48,924 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:48,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-12-14 11:59:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 302. [2022-12-14 11:59:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.352159468438538) internal successors, (1009), 301 states have internal predecessors, (1009), 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-12-14 11:59:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1009 transitions. [2022-12-14 11:59:48,929 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 1009 transitions. Word has length 24 [2022-12-14 11:59:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:48,929 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 1009 transitions. [2022-12-14 11:59:48,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 1009 transitions. [2022-12-14 11:59:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:48,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:48,930 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:48,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-14 11:59:48,930 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1395535237, now seen corresponding path program 35 times [2022-12-14 11:59:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:48,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230336086] [2022-12-14 11:59:48,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:49,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:49,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230336086] [2022-12-14 11:59:49,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230336086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:49,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:49,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:49,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791266004] [2022-12-14 11:59:49,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:49,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:49,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:49,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:49,177 INFO L87 Difference]: Start difference. First operand 302 states and 1009 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:49,438 INFO L93 Difference]: Finished difference Result 484 states and 1484 transitions. [2022-12-14 11:59:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:49,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:49,439 INFO L225 Difference]: With dead ends: 484 [2022-12-14 11:59:49,439 INFO L226 Difference]: Without dead ends: 484 [2022-12-14 11:59:49,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:49,439 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:49,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-12-14 11:59:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 304. [2022-12-14 11:59:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.3531353135313533) internal successors, (1016), 303 states have internal predecessors, (1016), 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-12-14 11:59:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1016 transitions. [2022-12-14 11:59:49,444 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1016 transitions. Word has length 24 [2022-12-14 11:59:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:49,444 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 1016 transitions. [2022-12-14 11:59:49,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1016 transitions. [2022-12-14 11:59:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:49,445 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:49,445 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:49,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-14 11:59:49,445 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash 245284167, now seen corresponding path program 36 times [2022-12-14 11:59:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:49,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705247137] [2022-12-14 11:59:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:49,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:49,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705247137] [2022-12-14 11:59:49,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705247137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:49,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:49,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:49,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660480521] [2022-12-14 11:59:49,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:49,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:49,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:49,666 INFO L87 Difference]: Start difference. First operand 304 states and 1016 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:49,953 INFO L93 Difference]: Finished difference Result 484 states and 1472 transitions. [2022-12-14 11:59:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 11:59:49,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:49,954 INFO L225 Difference]: With dead ends: 484 [2022-12-14 11:59:49,954 INFO L226 Difference]: Without dead ends: 478 [2022-12-14 11:59:49,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:59:49,955 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:49,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-12-14 11:59:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 298. [2022-12-14 11:59:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.367003367003367) internal successors, (1000), 297 states have internal predecessors, (1000), 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-12-14 11:59:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1000 transitions. [2022-12-14 11:59:49,963 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 1000 transitions. Word has length 24 [2022-12-14 11:59:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:49,963 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 1000 transitions. [2022-12-14 11:59:49,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 1000 transitions. [2022-12-14 11:59:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:49,964 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:49,964 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:49,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-14 11:59:49,964 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash 336277687, now seen corresponding path program 43 times [2022-12-14 11:59:49,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:49,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977413024] [2022-12-14 11:59:49,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:50,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:50,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977413024] [2022-12-14 11:59:50,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977413024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:50,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:50,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:50,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372360599] [2022-12-14 11:59:50,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:50,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:50,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:50,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:50,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:50,250 INFO L87 Difference]: Start difference. First operand 298 states and 1000 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:50,647 INFO L93 Difference]: Finished difference Result 520 states and 1628 transitions. [2022-12-14 11:59:50,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:50,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:50,649 INFO L225 Difference]: With dead ends: 520 [2022-12-14 11:59:50,649 INFO L226 Difference]: Without dead ends: 520 [2022-12-14 11:59:50,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:50,649 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:50,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-12-14 11:59:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 296. [2022-12-14 11:59:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.359322033898305) internal successors, (991), 295 states have internal predecessors, (991), 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-12-14 11:59:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 991 transitions. [2022-12-14 11:59:50,654 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 991 transitions. Word has length 24 [2022-12-14 11:59:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:50,654 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 991 transitions. [2022-12-14 11:59:50,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 991 transitions. [2022-12-14 11:59:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:50,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:50,655 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:50,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-14 11:59:50,655 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:50,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:50,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1599393087, now seen corresponding path program 44 times [2022-12-14 11:59:50,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:50,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733852392] [2022-12-14 11:59:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:50,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:50,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:50,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733852392] [2022-12-14 11:59:50,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733852392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:50,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:50,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:50,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076418731] [2022-12-14 11:59:50,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:50,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:50,883 INFO L87 Difference]: Start difference. First operand 296 states and 991 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:51,168 INFO L93 Difference]: Finished difference Result 504 states and 1584 transitions. [2022-12-14 11:59:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:51,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:51,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:51,169 INFO L225 Difference]: With dead ends: 504 [2022-12-14 11:59:51,169 INFO L226 Difference]: Without dead ends: 504 [2022-12-14 11:59:51,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:51,169 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:51,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-12-14 11:59:51,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 294. [2022-12-14 11:59:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3378839590443685) internal successors, (978), 293 states have internal predecessors, (978), 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-12-14 11:59:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 978 transitions. [2022-12-14 11:59:51,175 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 978 transitions. Word has length 24 [2022-12-14 11:59:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:51,175 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 978 transitions. [2022-12-14 11:59:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 978 transitions. [2022-12-14 11:59:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:51,176 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:51,176 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:51,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-14 11:59:51,176 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -56749323, now seen corresponding path program 37 times [2022-12-14 11:59:51,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:51,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938286978] [2022-12-14 11:59:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:51,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:51,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938286978] [2022-12-14 11:59:51,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938286978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:51,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:51,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284753011] [2022-12-14 11:59:51,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:51,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:51,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:51,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:51,419 INFO L87 Difference]: Start difference. First operand 294 states and 978 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:51,640 INFO L93 Difference]: Finished difference Result 502 states and 1547 transitions. [2022-12-14 11:59:51,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:51,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:51,641 INFO L225 Difference]: With dead ends: 502 [2022-12-14 11:59:51,641 INFO L226 Difference]: Without dead ends: 502 [2022-12-14 11:59:51,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:51,641 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:51,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-12-14 11:59:51,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 298. [2022-12-14 11:59:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.367003367003367) internal successors, (1000), 297 states have internal predecessors, (1000), 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-12-14 11:59:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1000 transitions. [2022-12-14 11:59:51,647 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 1000 transitions. Word has length 24 [2022-12-14 11:59:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:51,647 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 1000 transitions. [2022-12-14 11:59:51,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 1000 transitions. [2022-12-14 11:59:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:51,648 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:51,648 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:51,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-14 11:59:51,648 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash -171104589, now seen corresponding path program 38 times [2022-12-14 11:59:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:51,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671879456] [2022-12-14 11:59:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:51,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:51,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:51,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671879456] [2022-12-14 11:59:51,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671879456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:51,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:51,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:51,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279365591] [2022-12-14 11:59:51,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:51,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:51,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:51,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:51,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:51,879 INFO L87 Difference]: Start difference. First operand 298 states and 1000 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:52,093 INFO L93 Difference]: Finished difference Result 550 states and 1652 transitions. [2022-12-14 11:59:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:59:52,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:52,094 INFO L225 Difference]: With dead ends: 550 [2022-12-14 11:59:52,094 INFO L226 Difference]: Without dead ends: 550 [2022-12-14 11:59:52,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:52,094 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:52,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-12-14 11:59:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 294. [2022-12-14 11:59:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3378839590443685) internal successors, (978), 293 states have internal predecessors, (978), 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-12-14 11:59:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 978 transitions. [2022-12-14 11:59:52,100 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 978 transitions. Word has length 24 [2022-12-14 11:59:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:52,100 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 978 transitions. [2022-12-14 11:59:52,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 978 transitions. [2022-12-14 11:59:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:52,101 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:52,101 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:52,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-14 11:59:52,101 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:52,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:52,101 INFO L85 PathProgramCache]: Analyzing trace with hash -731556141, now seen corresponding path program 45 times [2022-12-14 11:59:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:52,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032266728] [2022-12-14 11:59:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:52,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:52,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032266728] [2022-12-14 11:59:52,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032266728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:59:52,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081393085] [2022-12-14 11:59:52,391 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:59:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:59:52,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:59:52,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:59:52,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:59:52,540 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:59:52,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:59:52,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 11:59:52,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:59:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:52,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:59:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:53,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081393085] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 11:59:53,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 11:59:53,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2022-12-14 11:59:53,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777958890] [2022-12-14 11:59:53,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:53,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:53,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:53,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-14 11:59:53,078 INFO L87 Difference]: Start difference. First operand 294 states and 978 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:53,325 INFO L93 Difference]: Finished difference Result 488 states and 1541 transitions. [2022-12-14 11:59:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:53,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:53,326 INFO L225 Difference]: With dead ends: 488 [2022-12-14 11:59:53,326 INFO L226 Difference]: Without dead ends: 488 [2022-12-14 11:59:53,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2022-12-14 11:59:53,327 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:53,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-12-14 11:59:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 298. [2022-12-14 11:59:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.356902356902357) internal successors, (997), 297 states have internal predecessors, (997), 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-12-14 11:59:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 997 transitions. [2022-12-14 11:59:53,337 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 997 transitions. Word has length 24 [2022-12-14 11:59:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:53,337 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 997 transitions. [2022-12-14 11:59:53,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 997 transitions. [2022-12-14 11:59:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:53,337 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:53,337 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:53,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 11:59:53,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2022-12-14 11:59:53,539 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1354794125, now seen corresponding path program 39 times [2022-12-14 11:59:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:53,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685257639] [2022-12-14 11:59:53,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:53,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685257639] [2022-12-14 11:59:53,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685257639] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:59:53,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799086641] [2022-12-14 11:59:53,885 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:59:53,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:59:53,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:59:53,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:59:53,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:59:54,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:59:54,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:59:54,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 11:59:54,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:59:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:54,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:59:54,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799086641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:54,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:59:54,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-12-14 11:59:54,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402861147] [2022-12-14 11:59:54,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:54,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:54,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:54,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:54,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:59:54,296 INFO L87 Difference]: Start difference. First operand 298 states and 997 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:54,486 INFO L93 Difference]: Finished difference Result 468 states and 1462 transitions. [2022-12-14 11:59:54,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:54,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:54,487 INFO L225 Difference]: With dead ends: 468 [2022-12-14 11:59:54,487 INFO L226 Difference]: Without dead ends: 468 [2022-12-14 11:59:54,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-14 11:59:54,488 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:54,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-12-14 11:59:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 298. [2022-12-14 11:59:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.356902356902357) internal successors, (997), 297 states have internal predecessors, (997), 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-12-14 11:59:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 997 transitions. [2022-12-14 11:59:54,497 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 997 transitions. Word has length 24 [2022-12-14 11:59:54,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:54,497 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 997 transitions. [2022-12-14 11:59:54,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 997 transitions. [2022-12-14 11:59:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:54,498 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:54,498 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:54,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:59:54,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:59:54,699 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:54,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1155823759, now seen corresponding path program 40 times [2022-12-14 11:59:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:54,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771321425] [2022-12-14 11:59:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:54,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:54,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771321425] [2022-12-14 11:59:54,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771321425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:54,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:54,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302624808] [2022-12-14 11:59:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:54,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:54,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:54,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:54,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:54,979 INFO L87 Difference]: Start difference. First operand 298 states and 997 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:55,191 INFO L93 Difference]: Finished difference Result 482 states and 1491 transitions. [2022-12-14 11:59:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:55,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:55,193 INFO L225 Difference]: With dead ends: 482 [2022-12-14 11:59:55,193 INFO L226 Difference]: Without dead ends: 476 [2022-12-14 11:59:55,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:55,193 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:55,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-12-14 11:59:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 298. [2022-12-14 11:59:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.3434343434343434) internal successors, (993), 297 states have internal predecessors, (993), 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-12-14 11:59:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 993 transitions. [2022-12-14 11:59:55,200 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 993 transitions. Word has length 24 [2022-12-14 11:59:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:55,200 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 993 transitions. [2022-12-14 11:59:55,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 993 transitions. [2022-12-14 11:59:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:55,201 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:55,201 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:55,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-14 11:59:55,202 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1742105407, now seen corresponding path program 46 times [2022-12-14 11:59:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:55,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634999094] [2022-12-14 11:59:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:55,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:55,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634999094] [2022-12-14 11:59:55,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634999094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:55,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:55,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239071473] [2022-12-14 11:59:55,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:55,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:55,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:55,455 INFO L87 Difference]: Start difference. First operand 298 states and 993 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:55,678 INFO L93 Difference]: Finished difference Result 460 states and 1470 transitions. [2022-12-14 11:59:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:55,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:55,679 INFO L225 Difference]: With dead ends: 460 [2022-12-14 11:59:55,679 INFO L226 Difference]: Without dead ends: 456 [2022-12-14 11:59:55,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:55,680 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:55,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-12-14 11:59:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 294. [2022-12-14 11:59:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3378839590443685) internal successors, (978), 293 states have internal predecessors, (978), 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-12-14 11:59:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 978 transitions. [2022-12-14 11:59:55,684 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 978 transitions. Word has length 24 [2022-12-14 11:59:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:55,684 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 978 transitions. [2022-12-14 11:59:55,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 978 transitions. [2022-12-14 11:59:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:55,685 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:55,685 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:55,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-14 11:59:55,685 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:55,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1238938417, now seen corresponding path program 41 times [2022-12-14 11:59:55,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:55,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428845912] [2022-12-14 11:59:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:55,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:55,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:55,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428845912] [2022-12-14 11:59:55,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428845912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:55,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:55,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163549434] [2022-12-14 11:59:55,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:55,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:55,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:55,956 INFO L87 Difference]: Start difference. First operand 294 states and 978 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:56,176 INFO L93 Difference]: Finished difference Result 472 states and 1461 transitions. [2022-12-14 11:59:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:56,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:56,177 INFO L225 Difference]: With dead ends: 472 [2022-12-14 11:59:56,177 INFO L226 Difference]: Without dead ends: 472 [2022-12-14 11:59:56,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:56,178 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:56,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-12-14 11:59:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 296. [2022-12-14 11:59:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3389830508474576) internal successors, (985), 295 states have internal predecessors, (985), 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-12-14 11:59:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 985 transitions. [2022-12-14 11:59:56,183 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 985 transitions. Word has length 24 [2022-12-14 11:59:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:56,183 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 985 transitions. [2022-12-14 11:59:56,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 985 transitions. [2022-12-14 11:59:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:56,184 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:56,184 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:56,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-14 11:59:56,184 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:56,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1905777809, now seen corresponding path program 42 times [2022-12-14 11:59:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:56,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19367406] [2022-12-14 11:59:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:56,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:56,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:56,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19367406] [2022-12-14 11:59:56,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19367406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:56,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:56,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:56,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67430086] [2022-12-14 11:59:56,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:56,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:56,423 INFO L87 Difference]: Start difference. First operand 296 states and 985 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:56,645 INFO L93 Difference]: Finished difference Result 450 states and 1411 transitions. [2022-12-14 11:59:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:56,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:56,646 INFO L225 Difference]: With dead ends: 450 [2022-12-14 11:59:56,646 INFO L226 Difference]: Without dead ends: 444 [2022-12-14 11:59:56,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:56,646 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:56,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-12-14 11:59:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 294. [2022-12-14 11:59:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3378839590443685) internal successors, (978), 293 states have internal predecessors, (978), 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-12-14 11:59:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 978 transitions. [2022-12-14 11:59:56,653 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 978 transitions. Word has length 24 [2022-12-14 11:59:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:56,653 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 978 transitions. [2022-12-14 11:59:56,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 978 transitions. [2022-12-14 11:59:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:56,654 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:56,654 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:56,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-14 11:59:56,654 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:56,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:56,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1092510579, now seen corresponding path program 47 times [2022-12-14 11:59:56,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:56,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365909137] [2022-12-14 11:59:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:56,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:56,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:56,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365909137] [2022-12-14 11:59:56,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365909137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:56,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:56,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:56,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990846707] [2022-12-14 11:59:56,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:56,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:56,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:56,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:56,941 INFO L87 Difference]: Start difference. First operand 294 states and 978 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:57,203 INFO L93 Difference]: Finished difference Result 444 states and 1427 transitions. [2022-12-14 11:59:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:57,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:57,204 INFO L225 Difference]: With dead ends: 444 [2022-12-14 11:59:57,204 INFO L226 Difference]: Without dead ends: 444 [2022-12-14 11:59:57,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:57,204 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:57,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-12-14 11:59:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 292. [2022-12-14 11:59:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.329896907216495) internal successors, (969), 291 states have internal predecessors, (969), 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-12-14 11:59:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 969 transitions. [2022-12-14 11:59:57,209 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 969 transitions. Word has length 24 [2022-12-14 11:59:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:57,209 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 969 transitions. [2022-12-14 11:59:57,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 969 transitions. [2022-12-14 11:59:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:57,209 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:57,209 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:57,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-14 11:59:57,209 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1612253655, now seen corresponding path program 48 times [2022-12-14 11:59:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:57,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968948210] [2022-12-14 11:59:57,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:57,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:57,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968948210] [2022-12-14 11:59:57,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968948210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:57,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:57,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:57,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619108313] [2022-12-14 11:59:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:57,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:57,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:57,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:57,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:57,456 INFO L87 Difference]: Start difference. First operand 292 states and 969 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:57,634 INFO L93 Difference]: Finished difference Result 400 states and 1328 transitions. [2022-12-14 11:59:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:59:57,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:57,635 INFO L225 Difference]: With dead ends: 400 [2022-12-14 11:59:57,635 INFO L226 Difference]: Without dead ends: 396 [2022-12-14 11:59:57,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:59:57,635 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:57,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:57,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-12-14 11:59:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 284. [2022-12-14 11:59:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.2791519434628977) internal successors, (928), 283 states have internal predecessors, (928), 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-12-14 11:59:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 928 transitions. [2022-12-14 11:59:57,639 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 928 transitions. Word has length 24 [2022-12-14 11:59:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:57,639 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 928 transitions. [2022-12-14 11:59:57,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 928 transitions. [2022-12-14 11:59:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:57,640 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:57,640 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:57,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-14 11:59:57,640 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:57,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1993916951, now seen corresponding path program 49 times [2022-12-14 11:59:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:57,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853735933] [2022-12-14 11:59:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:57,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:57,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:57,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853735933] [2022-12-14 11:59:57,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853735933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:57,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:57,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115207360] [2022-12-14 11:59:57,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:57,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:57,860 INFO L87 Difference]: Start difference. First operand 284 states and 928 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:58,067 INFO L93 Difference]: Finished difference Result 464 states and 1473 transitions. [2022-12-14 11:59:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:58,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:58,068 INFO L225 Difference]: With dead ends: 464 [2022-12-14 11:59:58,069 INFO L226 Difference]: Without dead ends: 464 [2022-12-14 11:59:58,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:58,069 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:58,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-12-14 11:59:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 290. [2022-12-14 11:59:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.311418685121107) internal successors, (957), 289 states have internal predecessors, (957), 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-12-14 11:59:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 957 transitions. [2022-12-14 11:59:58,074 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 957 transitions. Word has length 24 [2022-12-14 11:59:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:58,075 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 957 transitions. [2022-12-14 11:59:58,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 957 transitions. [2022-12-14 11:59:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:58,075 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:58,075 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:58,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-14 11:59:58,075 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash -654971709, now seen corresponding path program 50 times [2022-12-14 11:59:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:58,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889869436] [2022-12-14 11:59:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:58,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:58,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889869436] [2022-12-14 11:59:58,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889869436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:58,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:58,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026009164] [2022-12-14 11:59:58,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:58,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:58,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:58,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:58,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:58,318 INFO L87 Difference]: Start difference. First operand 290 states and 957 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:58,546 INFO L93 Difference]: Finished difference Result 476 states and 1529 transitions. [2022-12-14 11:59:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:58,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:58,547 INFO L225 Difference]: With dead ends: 476 [2022-12-14 11:59:58,547 INFO L226 Difference]: Without dead ends: 476 [2022-12-14 11:59:58,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:58,547 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:58,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-12-14 11:59:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 294. [2022-12-14 11:59:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3412969283276452) internal successors, (979), 293 states have internal predecessors, (979), 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-12-14 11:59:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 979 transitions. [2022-12-14 11:59:58,552 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 979 transitions. Word has length 24 [2022-12-14 11:59:58,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:58,552 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 979 transitions. [2022-12-14 11:59:58,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 979 transitions. [2022-12-14 11:59:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:58,553 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:58,553 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:58,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-14 11:59:58,553 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1243451691, now seen corresponding path program 51 times [2022-12-14 11:59:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:58,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283944671] [2022-12-14 11:59:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:58,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:58,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283944671] [2022-12-14 11:59:58,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283944671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:58,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:58,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:58,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501152052] [2022-12-14 11:59:58,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:58,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:58,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:58,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:58,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:58,787 INFO L87 Difference]: Start difference. First operand 294 states and 979 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:59,085 INFO L93 Difference]: Finished difference Result 474 states and 1523 transitions. [2022-12-14 11:59:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:59,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:59,086 INFO L225 Difference]: With dead ends: 474 [2022-12-14 11:59:59,086 INFO L226 Difference]: Without dead ends: 474 [2022-12-14 11:59:59,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:59:59,086 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:59,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-12-14 11:59:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 286. [2022-12-14 11:59:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 3.294736842105263) internal successors, (939), 285 states have internal predecessors, (939), 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-12-14 11:59:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 939 transitions. [2022-12-14 11:59:59,091 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 939 transitions. Word has length 24 [2022-12-14 11:59:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:59,091 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 939 transitions. [2022-12-14 11:59:59,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 939 transitions. [2022-12-14 11:59:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:59,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:59,092 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:59,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-14 11:59:59,092 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:59,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:59,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1292852373, now seen corresponding path program 43 times [2022-12-14 11:59:59,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:59,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446488497] [2022-12-14 11:59:59,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:59,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:59,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:59,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446488497] [2022-12-14 11:59:59,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446488497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:59,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:59,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:59,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333540805] [2022-12-14 11:59:59,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:59,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:59,322 INFO L87 Difference]: Start difference. First operand 286 states and 939 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:59,467 INFO L93 Difference]: Finished difference Result 460 states and 1435 transitions. [2022-12-14 11:59:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:59:59,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:59,468 INFO L225 Difference]: With dead ends: 460 [2022-12-14 11:59:59,468 INFO L226 Difference]: Without dead ends: 460 [2022-12-14 11:59:59,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:59,468 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:59,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:59:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-12-14 11:59:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 290. [2022-12-14 11:59:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.311418685121107) internal successors, (957), 289 states have internal predecessors, (957), 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-12-14 11:59:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 957 transitions. [2022-12-14 11:59:59,473 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 957 transitions. Word has length 24 [2022-12-14 11:59:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:59,473 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 957 transitions. [2022-12-14 11:59:59,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 957 transitions. [2022-12-14 11:59:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:59,474 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:59,474 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:59,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-14 11:59:59,474 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:59,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1237367061, now seen corresponding path program 44 times [2022-12-14 11:59:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:59,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255460292] [2022-12-14 11:59:59,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:59:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:59:59,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:59:59,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255460292] [2022-12-14 11:59:59,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255460292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:59:59,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:59:59,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:59:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900497296] [2022-12-14 11:59:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:59:59,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:59:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:59:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:59:59,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:59:59,726 INFO L87 Difference]: Start difference. First operand 290 states and 957 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:59:59,953 INFO L93 Difference]: Finished difference Result 482 states and 1497 transitions. [2022-12-14 11:59:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:59:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:59:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:59:59,954 INFO L225 Difference]: With dead ends: 482 [2022-12-14 11:59:59,954 INFO L226 Difference]: Without dead ends: 482 [2022-12-14 11:59:59,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-14 11:59:59,955 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:59:59,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:59:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-12-14 11:59:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 294. [2022-12-14 11:59:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3412969283276452) internal successors, (979), 293 states have internal predecessors, (979), 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-12-14 11:59:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 979 transitions. [2022-12-14 11:59:59,959 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 979 transitions. Word has length 24 [2022-12-14 11:59:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:59:59,959 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 979 transitions. [2022-12-14 11:59:59,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:59:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 979 transitions. [2022-12-14 11:59:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:59:59,960 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:59:59,960 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:59:59,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-14 11:59:59,960 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 11:59:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:59:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash 421512045, now seen corresponding path program 45 times [2022-12-14 11:59:59,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:59:59,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928566001] [2022-12-14 11:59:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:59:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:59:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:00,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:00,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928566001] [2022-12-14 12:00:00,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928566001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:00,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:00,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:00,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084996169] [2022-12-14 12:00:00,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:00,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:00,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:00,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:00,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:00,197 INFO L87 Difference]: Start difference. First operand 294 states and 979 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:00,404 INFO L93 Difference]: Finished difference Result 468 states and 1469 transitions. [2022-12-14 12:00:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:00,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:00,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:00,405 INFO L225 Difference]: With dead ends: 468 [2022-12-14 12:00:00,405 INFO L226 Difference]: Without dead ends: 468 [2022-12-14 12:00:00,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:00,405 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:00,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-12-14 12:00:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 290. [2022-12-14 12:00:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.311418685121107) internal successors, (957), 289 states have internal predecessors, (957), 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-12-14 12:00:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 957 transitions. [2022-12-14 12:00:00,410 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 957 transitions. Word has length 24 [2022-12-14 12:00:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:00,410 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 957 transitions. [2022-12-14 12:00:00,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 957 transitions. [2022-12-14 12:00:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:00,411 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:00,411 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:00,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-14 12:00:00,411 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash -35962673, now seen corresponding path program 46 times [2022-12-14 12:00:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:00,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853509467] [2022-12-14 12:00:00,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:00,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:00,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:00,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853509467] [2022-12-14 12:00:00,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853509467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:00,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:00,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 12:00:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86546579] [2022-12-14 12:00:00,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:00,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 12:00:00,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 12:00:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:00,677 INFO L87 Difference]: Start difference. First operand 290 states and 957 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:00,877 INFO L93 Difference]: Finished difference Result 496 states and 1519 transitions. [2022-12-14 12:00:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:00,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:00,878 INFO L225 Difference]: With dead ends: 496 [2022-12-14 12:00:00,878 INFO L226 Difference]: Without dead ends: 496 [2022-12-14 12:00:00,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:00,879 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:00,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:00,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-12-14 12:00:00,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 292. [2022-12-14 12:00:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3058419243986252) internal successors, (962), 291 states have internal predecessors, (962), 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-12-14 12:00:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 962 transitions. [2022-12-14 12:00:00,883 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 962 transitions. Word has length 24 [2022-12-14 12:00:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:00,884 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 962 transitions. [2022-12-14 12:00:00,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 962 transitions. [2022-12-14 12:00:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:00,884 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:00,884 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:00,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-14 12:00:00,884 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:00,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1947782883, now seen corresponding path program 47 times [2022-12-14 12:00:00,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:00,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616808468] [2022-12-14 12:00:00,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:00,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:01,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:01,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616808468] [2022-12-14 12:00:01,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616808468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:01,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:01,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:01,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303328028] [2022-12-14 12:00:01,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:01,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:01,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:01,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:01,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:01,151 INFO L87 Difference]: Start difference. First operand 292 states and 962 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:01,573 INFO L93 Difference]: Finished difference Result 496 states and 1520 transitions. [2022-12-14 12:00:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 12:00:01,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:01,574 INFO L225 Difference]: With dead ends: 496 [2022-12-14 12:00:01,574 INFO L226 Difference]: Without dead ends: 496 [2022-12-14 12:00:01,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-12-14 12:00:01,575 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:01,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-12-14 12:00:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 294. [2022-12-14 12:00:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3071672354948807) internal successors, (969), 293 states have internal predecessors, (969), 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-12-14 12:00:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 969 transitions. [2022-12-14 12:00:01,579 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 969 transitions. Word has length 24 [2022-12-14 12:00:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:01,580 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 969 transitions. [2022-12-14 12:00:01,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 969 transitions. [2022-12-14 12:00:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:01,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:01,580 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:01,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-14 12:00:01,580 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1196933343, now seen corresponding path program 48 times [2022-12-14 12:00:01,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:01,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596405713] [2022-12-14 12:00:01,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:01,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:01,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:01,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596405713] [2022-12-14 12:00:01,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596405713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:01,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:01,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:01,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905664874] [2022-12-14 12:00:01,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:01,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:01,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:01,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:01,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:01,799 INFO L87 Difference]: Start difference. First operand 294 states and 969 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:01,907 INFO L93 Difference]: Finished difference Result 470 states and 1453 transitions. [2022-12-14 12:00:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:01,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:01,908 INFO L225 Difference]: With dead ends: 470 [2022-12-14 12:00:01,908 INFO L226 Difference]: Without dead ends: 464 [2022-12-14 12:00:01,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:01,908 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:01,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-12-14 12:00:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 290. [2022-12-14 12:00:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.311418685121107) internal successors, (957), 289 states have internal predecessors, (957), 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-12-14 12:00:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 957 transitions. [2022-12-14 12:00:01,912 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 957 transitions. Word has length 24 [2022-12-14 12:00:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:01,913 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 957 transitions. [2022-12-14 12:00:01,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 957 transitions. [2022-12-14 12:00:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:01,913 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:01,913 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:01,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-14 12:00:01,913 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash 388573649, now seen corresponding path program 52 times [2022-12-14 12:00:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:01,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226426413] [2022-12-14 12:00:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:01,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:02,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:02,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226426413] [2022-12-14 12:00:02,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226426413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:02,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:02,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 12:00:02,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052197214] [2022-12-14 12:00:02,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:02,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 12:00:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 12:00:02,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:02,161 INFO L87 Difference]: Start difference. First operand 290 states and 957 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:02,327 INFO L93 Difference]: Finished difference Result 402 states and 1282 transitions. [2022-12-14 12:00:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:02,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:02,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:02,328 INFO L225 Difference]: With dead ends: 402 [2022-12-14 12:00:02,328 INFO L226 Difference]: Without dead ends: 402 [2022-12-14 12:00:02,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:02,328 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:02,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-12-14 12:00:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2022-12-14 12:00:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3058419243986252) internal successors, (962), 291 states have internal predecessors, (962), 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-12-14 12:00:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 962 transitions. [2022-12-14 12:00:02,332 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 962 transitions. Word has length 24 [2022-12-14 12:00:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:02,332 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 962 transitions. [2022-12-14 12:00:02,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 962 transitions. [2022-12-14 12:00:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:02,333 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:02,333 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:02,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-14 12:00:02,333 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:02,333 INFO L85 PathProgramCache]: Analyzing trace with hash -122680153, now seen corresponding path program 53 times [2022-12-14 12:00:02,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:02,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347236650] [2022-12-14 12:00:02,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:02,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:02,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:02,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347236650] [2022-12-14 12:00:02,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347236650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:02,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:02,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:02,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491124431] [2022-12-14 12:00:02,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:02,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:02,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:02,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:02,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:02,606 INFO L87 Difference]: Start difference. First operand 292 states and 962 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:02,887 INFO L93 Difference]: Finished difference Result 396 states and 1262 transitions. [2022-12-14 12:00:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:02,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:02,888 INFO L225 Difference]: With dead ends: 396 [2022-12-14 12:00:02,888 INFO L226 Difference]: Without dead ends: 396 [2022-12-14 12:00:02,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:02,888 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:02,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-12-14 12:00:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 294. [2022-12-14 12:00:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3071672354948807) internal successors, (969), 293 states have internal predecessors, (969), 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-12-14 12:00:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 969 transitions. [2022-12-14 12:00:02,892 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 969 transitions. Word has length 24 [2022-12-14 12:00:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:02,892 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 969 transitions. [2022-12-14 12:00:02,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 969 transitions. [2022-12-14 12:00:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:02,893 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:02,893 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:02,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-12-14 12:00:02,893 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:02,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash 397062923, now seen corresponding path program 54 times [2022-12-14 12:00:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:02,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803218111] [2022-12-14 12:00:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:03,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:03,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803218111] [2022-12-14 12:00:03,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803218111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:03,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:03,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:03,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411297903] [2022-12-14 12:00:03,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:03,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:03,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:03,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:03,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:03,122 INFO L87 Difference]: Start difference. First operand 294 states and 969 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:03,296 INFO L93 Difference]: Finished difference Result 376 states and 1220 transitions. [2022-12-14 12:00:03,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:03,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:03,297 INFO L225 Difference]: With dead ends: 376 [2022-12-14 12:00:03,297 INFO L226 Difference]: Without dead ends: 372 [2022-12-14 12:00:03,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:03,297 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:03,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-12-14 12:00:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 292. [2022-12-14 12:00:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3058419243986252) internal successors, (962), 291 states have internal predecessors, (962), 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-12-14 12:00:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 962 transitions. [2022-12-14 12:00:03,301 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 962 transitions. Word has length 24 [2022-12-14 12:00:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:03,302 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 962 transitions. [2022-12-14 12:00:03,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 962 transitions. [2022-12-14 12:00:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:03,302 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:03,302 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:03,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-14 12:00:03,302 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:03,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:03,302 INFO L85 PathProgramCache]: Analyzing trace with hash 676029613, now seen corresponding path program 55 times [2022-12-14 12:00:03,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:03,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402587015] [2022-12-14 12:00:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:03,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:03,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402587015] [2022-12-14 12:00:03,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402587015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:03,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:03,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:03,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690604162] [2022-12-14 12:00:03,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:03,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:03,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:03,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:03,539 INFO L87 Difference]: Start difference. First operand 292 states and 962 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:03,705 INFO L93 Difference]: Finished difference Result 482 states and 1539 transitions. [2022-12-14 12:00:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:03,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:03,706 INFO L225 Difference]: With dead ends: 482 [2022-12-14 12:00:03,707 INFO L226 Difference]: Without dead ends: 482 [2022-12-14 12:00:03,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:03,707 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:03,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-12-14 12:00:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 298. [2022-12-14 12:00:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.356902356902357) internal successors, (997), 297 states have internal predecessors, (997), 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-12-14 12:00:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 997 transitions. [2022-12-14 12:00:03,712 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 997 transitions. Word has length 24 [2022-12-14 12:00:03,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:03,712 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 997 transitions. [2022-12-14 12:00:03,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 997 transitions. [2022-12-14 12:00:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:03,713 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:03,713 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:03,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-12-14 12:00:03,713 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1834869549, now seen corresponding path program 56 times [2022-12-14 12:00:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:03,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089807600] [2022-12-14 12:00:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:03,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:03,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089807600] [2022-12-14 12:00:03,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089807600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:03,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:03,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:03,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470509331] [2022-12-14 12:00:03,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:03,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:03,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:03,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:03,971 INFO L87 Difference]: Start difference. First operand 298 states and 997 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:04,323 INFO L93 Difference]: Finished difference Result 502 states and 1572 transitions. [2022-12-14 12:00:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:04,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:04,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:04,325 INFO L225 Difference]: With dead ends: 502 [2022-12-14 12:00:04,325 INFO L226 Difference]: Without dead ends: 502 [2022-12-14 12:00:04,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:04,325 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:04,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-12-14 12:00:04,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 294. [2022-12-14 12:00:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3276450511945392) internal successors, (975), 293 states have internal predecessors, (975), 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-12-14 12:00:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 975 transitions. [2022-12-14 12:00:04,333 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 975 transitions. Word has length 24 [2022-12-14 12:00:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:04,333 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 975 transitions. [2022-12-14 12:00:04,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 975 transitions. [2022-12-14 12:00:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:04,334 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:04,334 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:04,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-12-14 12:00:04,334 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:04,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:04,334 INFO L85 PathProgramCache]: Analyzing trace with hash 283002603, now seen corresponding path program 49 times [2022-12-14 12:00:04,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:04,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606571041] [2022-12-14 12:00:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:04,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:04,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606571041] [2022-12-14 12:00:04,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606571041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:04,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:04,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422563464] [2022-12-14 12:00:04,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:04,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:04,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:04,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:04,659 INFO L87 Difference]: Start difference. First operand 294 states and 975 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:04,803 INFO L93 Difference]: Finished difference Result 532 states and 1678 transitions. [2022-12-14 12:00:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:04,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:04,805 INFO L225 Difference]: With dead ends: 532 [2022-12-14 12:00:04,805 INFO L226 Difference]: Without dead ends: 532 [2022-12-14 12:00:04,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:04,805 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:04,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-12-14 12:00:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 298. [2022-12-14 12:00:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.356902356902357) internal successors, (997), 297 states have internal predecessors, (997), 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-12-14 12:00:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 997 transitions. [2022-12-14 12:00:04,810 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 997 transitions. Word has length 24 [2022-12-14 12:00:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:04,810 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 997 transitions. [2022-12-14 12:00:04,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 997 transitions. [2022-12-14 12:00:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:04,811 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:04,811 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:04,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-12-14 12:00:04,811 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:04,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash 168647337, now seen corresponding path program 50 times [2022-12-14 12:00:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:04,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617558461] [2022-12-14 12:00:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:04,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:05,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:05,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617558461] [2022-12-14 12:00:05,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617558461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:05,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:05,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290013429] [2022-12-14 12:00:05,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:05,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:05,051 INFO L87 Difference]: Start difference. First operand 298 states and 997 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:05,186 INFO L93 Difference]: Finished difference Result 524 states and 1654 transitions. [2022-12-14 12:00:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:05,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:05,187 INFO L225 Difference]: With dead ends: 524 [2022-12-14 12:00:05,187 INFO L226 Difference]: Without dead ends: 524 [2022-12-14 12:00:05,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:05,188 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:05,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-12-14 12:00:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 294. [2022-12-14 12:00:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3276450511945392) internal successors, (975), 293 states have internal predecessors, (975), 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-12-14 12:00:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 975 transitions. [2022-12-14 12:00:05,194 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 975 transitions. Word has length 24 [2022-12-14 12:00:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:05,194 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 975 transitions. [2022-12-14 12:00:05,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 975 transitions. [2022-12-14 12:00:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:05,194 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:05,195 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:05,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-12-14 12:00:05,195 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:05,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:05,195 INFO L85 PathProgramCache]: Analyzing trace with hash -391804215, now seen corresponding path program 57 times [2022-12-14 12:00:05,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:05,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110026778] [2022-12-14 12:00:05,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:05,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:05,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:05,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110026778] [2022-12-14 12:00:05,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110026778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:05,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:05,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:05,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020230017] [2022-12-14 12:00:05,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:05,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:05,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:05,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:05,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:05,463 INFO L87 Difference]: Start difference. First operand 294 states and 975 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:05,735 INFO L93 Difference]: Finished difference Result 470 states and 1481 transitions. [2022-12-14 12:00:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:05,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:05,736 INFO L225 Difference]: With dead ends: 470 [2022-12-14 12:00:05,736 INFO L226 Difference]: Without dead ends: 470 [2022-12-14 12:00:05,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:05,736 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:05,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-12-14 12:00:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 298. [2022-12-14 12:00:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.346801346801347) internal successors, (994), 297 states have internal predecessors, (994), 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-12-14 12:00:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 994 transitions. [2022-12-14 12:00:05,741 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 994 transitions. Word has length 24 [2022-12-14 12:00:05,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:05,741 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 994 transitions. [2022-12-14 12:00:05,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 994 transitions. [2022-12-14 12:00:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:05,742 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:05,742 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:05,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2022-12-14 12:00:05,742 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:05,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:05,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1015042199, now seen corresponding path program 51 times [2022-12-14 12:00:05,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:05,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714593327] [2022-12-14 12:00:05,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:05,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:05,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714593327] [2022-12-14 12:00:05,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714593327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:05,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:05,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:05,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57801559] [2022-12-14 12:00:05,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:05,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:05,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:05,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:05,979 INFO L87 Difference]: Start difference. First operand 298 states and 994 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:06,159 INFO L93 Difference]: Finished difference Result 504 states and 1572 transitions. [2022-12-14 12:00:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:06,161 INFO L225 Difference]: With dead ends: 504 [2022-12-14 12:00:06,161 INFO L226 Difference]: Without dead ends: 504 [2022-12-14 12:00:06,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:06,161 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:06,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-12-14 12:00:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 298. [2022-12-14 12:00:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.346801346801347) internal successors, (994), 297 states have internal predecessors, (994), 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-12-14 12:00:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 994 transitions. [2022-12-14 12:00:06,169 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 994 transitions. Word has length 24 [2022-12-14 12:00:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:06,169 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 994 transitions. [2022-12-14 12:00:06,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 994 transitions. [2022-12-14 12:00:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:06,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:06,170 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:06,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-12-14 12:00:06,170 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1495575685, now seen corresponding path program 52 times [2022-12-14 12:00:06,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:06,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416232744] [2022-12-14 12:00:06,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:06,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:06,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:06,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416232744] [2022-12-14 12:00:06,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416232744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:06,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:06,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:06,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778630862] [2022-12-14 12:00:06,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:06,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:06,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:06,459 INFO L87 Difference]: Start difference. First operand 298 states and 994 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:06,695 INFO L93 Difference]: Finished difference Result 480 states and 1509 transitions. [2022-12-14 12:00:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:06,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:06,696 INFO L225 Difference]: With dead ends: 480 [2022-12-14 12:00:06,696 INFO L226 Difference]: Without dead ends: 474 [2022-12-14 12:00:06,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:06,696 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:06,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:06,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-12-14 12:00:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 298. [2022-12-14 12:00:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.3333333333333335) internal successors, (990), 297 states have internal predecessors, (990), 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-12-14 12:00:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 990 transitions. [2022-12-14 12:00:06,701 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 990 transitions. Word has length 24 [2022-12-14 12:00:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:06,701 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 990 transitions. [2022-12-14 12:00:06,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 990 transitions. [2022-12-14 12:00:06,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:06,702 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:06,702 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:06,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-14 12:00:06,702 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:06,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2081857333, now seen corresponding path program 58 times [2022-12-14 12:00:06,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:06,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147715826] [2022-12-14 12:00:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:06,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:06,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:06,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147715826] [2022-12-14 12:00:06,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147715826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:06,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:06,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891026038] [2022-12-14 12:00:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:06,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:06,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:06,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:06,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:06,966 INFO L87 Difference]: Start difference. First operand 298 states and 990 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:07,153 INFO L93 Difference]: Finished difference Result 422 states and 1352 transitions. [2022-12-14 12:00:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2022-12-14 12:00:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:13,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:13,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82583954] [2022-12-14 12:00:13,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82583954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:13,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:13,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:13,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725594634] [2022-12-14 12:00:13,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:13,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:13,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:13,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:13,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:13,552 INFO L87 Difference]: Start difference. First operand 296 states and 974 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:13,739 INFO L93 Difference]: Finished difference Result 386 states and 1196 transitions. [2022-12-14 12:00:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:13,740 INFO L225 Difference]: With dead ends: 386 [2022-12-14 12:00:13,740 INFO L226 Difference]: Without dead ends: 382 [2022-12-14 12:00:13,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:13,740 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:13,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-12-14 12:00:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 292. [2022-12-14 12:00:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3058419243986252) internal successors, (962), 291 states have internal predecessors, (962), 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-12-14 12:00:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 962 transitions. [2022-12-14 12:00:13,744 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 962 transitions. Word has length 24 [2022-12-14 12:00:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:13,744 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 962 transitions. [2022-12-14 12:00:13,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 962 transitions. [2022-12-14 12:00:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:13,745 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:13,745 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:13,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2022-12-14 12:00:13,745 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:13,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1242136817, now seen corresponding path program 61 times [2022-12-14 12:00:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:13,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950175602] [2022-12-14 12:00:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:13,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:13,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950175602] [2022-12-14 12:00:13,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950175602] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:13,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642680146] [2022-12-14 12:00:13,984 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:00:13,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:13,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:13,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:13,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 12:00:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:14,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 12:00:14,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:14,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:00:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:14,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642680146] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:14,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 12:00:14,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2022-12-14 12:00:14,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356460716] [2022-12-14 12:00:14,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:14,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:14,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:14,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:14,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-14 12:00:14,398 INFO L87 Difference]: Start difference. First operand 292 states and 962 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:14,562 INFO L93 Difference]: Finished difference Result 528 states and 1707 transitions. [2022-12-14 12:00:14,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:14,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:14,563 INFO L225 Difference]: With dead ends: 528 [2022-12-14 12:00:14,563 INFO L226 Difference]: Without dead ends: 528 [2022-12-14 12:00:14,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-12-14 12:00:14,563 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:14,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-12-14 12:00:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 298. [2022-12-14 12:00:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.3367003367003365) internal successors, (991), 297 states have internal predecessors, (991), 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-12-14 12:00:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 991 transitions. [2022-12-14 12:00:14,568 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 991 transitions. Word has length 24 [2022-12-14 12:00:14,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:14,568 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 991 transitions. [2022-12-14 12:00:14,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 991 transitions. [2022-12-14 12:00:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:14,569 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:14,569 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:14,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-14 12:00:14,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:14,770 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -86106401, now seen corresponding path program 62 times [2022-12-14 12:00:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:14,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238321999] [2022-12-14 12:00:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:15,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:15,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238321999] [2022-12-14 12:00:15,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238321999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:15,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:15,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775356360] [2022-12-14 12:00:15,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:15,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:15,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:15,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:15,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:15,063 INFO L87 Difference]: Start difference. First operand 298 states and 991 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:15,224 INFO L93 Difference]: Finished difference Result 542 states and 1755 transitions. [2022-12-14 12:00:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:15,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:15,226 INFO L225 Difference]: With dead ends: 542 [2022-12-14 12:00:15,226 INFO L226 Difference]: Without dead ends: 542 [2022-12-14 12:00:15,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:15,226 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:15,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-12-14 12:00:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 302. [2022-12-14 12:00:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.3654485049833887) internal successors, (1013), 301 states have internal predecessors, (1013), 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-12-14 12:00:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1013 transitions. [2022-12-14 12:00:15,231 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 1013 transitions. Word has length 24 [2022-12-14 12:00:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:15,231 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 1013 transitions. [2022-12-14 12:00:15,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 1013 transitions. [2022-12-14 12:00:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:15,231 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:15,231 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:15,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2022-12-14 12:00:15,232 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1572772705, now seen corresponding path program 63 times [2022-12-14 12:00:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:15,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467200413] [2022-12-14 12:00:15,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:15,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:15,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:15,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467200413] [2022-12-14 12:00:15,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467200413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:15,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:15,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:15,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713686707] [2022-12-14 12:00:15,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:15,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:15,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:15,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:15,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:15,450 INFO L87 Difference]: Start difference. First operand 302 states and 1013 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:15,560 INFO L93 Difference]: Finished difference Result 512 states and 1683 transitions. [2022-12-14 12:00:15,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:15,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:15,561 INFO L225 Difference]: With dead ends: 512 [2022-12-14 12:00:15,561 INFO L226 Difference]: Without dead ends: 512 [2022-12-14 12:00:15,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:15,562 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:15,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-12-14 12:00:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 294. [2022-12-14 12:00:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3208191126279862) internal successors, (973), 293 states have internal predecessors, (973), 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-12-14 12:00:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 973 transitions. [2022-12-14 12:00:15,568 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 973 transitions. Word has length 24 [2022-12-14 12:00:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:15,568 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 973 transitions. [2022-12-14 12:00:15,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 973 transitions. [2022-12-14 12:00:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:15,569 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:15,569 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:15,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2022-12-14 12:00:15,569 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash -342546381, now seen corresponding path program 64 times [2022-12-14 12:00:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:15,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687391051] [2022-12-14 12:00:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:15,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:15,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687391051] [2022-12-14 12:00:15,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687391051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:15,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:15,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 12:00:15,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902111181] [2022-12-14 12:00:15,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:15,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 12:00:15,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:15,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 12:00:15,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:15,824 INFO L87 Difference]: Start difference. First operand 294 states and 973 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:15,941 INFO L93 Difference]: Finished difference Result 458 states and 1483 transitions. [2022-12-14 12:00:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:15,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:15,942 INFO L225 Difference]: With dead ends: 458 [2022-12-14 12:00:15,942 INFO L226 Difference]: Without dead ends: 458 [2022-12-14 12:00:15,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:15,942 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:15,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-12-14 12:00:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 298. [2022-12-14 12:00:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.3265993265993266) internal successors, (988), 297 states have internal predecessors, (988), 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-12-14 12:00:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 988 transitions. [2022-12-14 12:00:15,947 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 988 transitions. Word has length 24 [2022-12-14 12:00:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:15,947 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 988 transitions. [2022-12-14 12:00:15,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 988 transitions. [2022-12-14 12:00:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:15,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:15,947 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:15,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2022-12-14 12:00:15,947 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:15,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:15,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1827308807, now seen corresponding path program 67 times [2022-12-14 12:00:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:15,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718339912] [2022-12-14 12:00:15,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:16,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:16,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718339912] [2022-12-14 12:00:16,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718339912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:16,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:16,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:16,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019676486] [2022-12-14 12:00:16,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:16,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:16,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:16,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:16,179 INFO L87 Difference]: Start difference. First operand 298 states and 988 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:16,370 INFO L93 Difference]: Finished difference Result 452 states and 1415 transitions. [2022-12-14 12:00:16,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 12:00:16,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:16,371 INFO L225 Difference]: With dead ends: 452 [2022-12-14 12:00:16,371 INFO L226 Difference]: Without dead ends: 444 [2022-12-14 12:00:16,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:16,371 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:16,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-12-14 12:00:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 298. [2022-12-14 12:00:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.313131313131313) internal successors, (984), 297 states have internal predecessors, (984), 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-12-14 12:00:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 984 transitions. [2022-12-14 12:00:16,375 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 984 transitions. Word has length 24 [2022-12-14 12:00:16,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:16,376 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 984 transitions. [2022-12-14 12:00:16,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 984 transitions. [2022-12-14 12:00:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:16,376 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:16,376 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:16,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2022-12-14 12:00:16,376 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash -593856215, now seen corresponding path program 68 times [2022-12-14 12:00:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:16,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059809340] [2022-12-14 12:00:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:16,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:16,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059809340] [2022-12-14 12:00:16,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059809340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:16,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:16,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 12:00:16,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707453812] [2022-12-14 12:00:16,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:16,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 12:00:16,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:16,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 12:00:16,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:16,608 INFO L87 Difference]: Start difference. First operand 298 states and 984 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:16,772 INFO L93 Difference]: Finished difference Result 464 states and 1457 transitions. [2022-12-14 12:00:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:16,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:16,774 INFO L225 Difference]: With dead ends: 464 [2022-12-14 12:00:16,774 INFO L226 Difference]: Without dead ends: 464 [2022-12-14 12:00:16,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=38, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:16,774 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:16,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-12-14 12:00:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 302. [2022-12-14 12:00:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.3322259136212624) internal successors, (1003), 301 states have internal predecessors, (1003), 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-12-14 12:00:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1003 transitions. [2022-12-14 12:00:16,779 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 1003 transitions. Word has length 24 [2022-12-14 12:00:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:16,779 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 1003 transitions. [2022-12-14 12:00:16,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 1003 transitions. [2022-12-14 12:00:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:16,780 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:16,780 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:16,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2022-12-14 12:00:16,780 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:16,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1181151147, now seen corresponding path program 65 times [2022-12-14 12:00:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:16,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442554963] [2022-12-14 12:00:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:17,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:17,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442554963] [2022-12-14 12:00:17,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442554963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:17,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:17,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058944802] [2022-12-14 12:00:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:17,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:17,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:17,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:17,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:17,054 INFO L87 Difference]: Start difference. First operand 302 states and 1003 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:17,274 INFO L93 Difference]: Finished difference Result 444 states and 1435 transitions. [2022-12-14 12:00:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:17,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:17,275 INFO L225 Difference]: With dead ends: 444 [2022-12-14 12:00:17,275 INFO L226 Difference]: Without dead ends: 444 [2022-12-14 12:00:17,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:17,275 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:17,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-12-14 12:00:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 302. [2022-12-14 12:00:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.3322259136212624) internal successors, (1003), 301 states have internal predecessors, (1003), 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-12-14 12:00:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1003 transitions. [2022-12-14 12:00:17,279 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 1003 transitions. Word has length 24 [2022-12-14 12:00:17,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:17,279 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 1003 transitions. [2022-12-14 12:00:17,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 1003 transitions. [2022-12-14 12:00:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:17,280 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:17,280 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:17,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2022-12-14 12:00:17,280 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash 820383311, now seen corresponding path program 66 times [2022-12-14 12:00:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:17,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854313819] [2022-12-14 12:00:17,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:17,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:17,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:17,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854313819] [2022-12-14 12:00:17,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854313819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:17,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:17,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:17,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723145885] [2022-12-14 12:00:17,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:17,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:17,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:17,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:17,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:17,513 INFO L87 Difference]: Start difference. First operand 302 states and 1003 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:17,700 INFO L93 Difference]: Finished difference Result 370 states and 1258 transitions. [2022-12-14 12:00:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:17,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:17,701 INFO L225 Difference]: With dead ends: 370 [2022-12-14 12:00:17,701 INFO L226 Difference]: Without dead ends: 364 [2022-12-14 12:00:17,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:17,702 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:17,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-12-14 12:00:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 302. [2022-12-14 12:00:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.318936877076412) internal successors, (999), 301 states have internal predecessors, (999), 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-12-14 12:00:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 999 transitions. [2022-12-14 12:00:17,707 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 999 transitions. Word has length 24 [2022-12-14 12:00:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:17,707 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 999 transitions. [2022-12-14 12:00:17,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 999 transitions. [2022-12-14 12:00:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:17,708 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:17,708 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:17,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2022-12-14 12:00:17,708 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1840901605, now seen corresponding path program 69 times [2022-12-14 12:00:17,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:17,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003182097] [2022-12-14 12:00:17,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:17,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:17,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:17,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003182097] [2022-12-14 12:00:17,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003182097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:17,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:17,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:17,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908795331] [2022-12-14 12:00:17,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:17,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:17,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:17,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:17,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:17,935 INFO L87 Difference]: Start difference. First operand 302 states and 999 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:18,121 INFO L93 Difference]: Finished difference Result 462 states and 1445 transitions. [2022-12-14 12:00:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:18,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:18,122 INFO L225 Difference]: With dead ends: 462 [2022-12-14 12:00:18,122 INFO L226 Difference]: Without dead ends: 458 [2022-12-14 12:00:18,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:18,123 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:18,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-12-14 12:00:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 294. [2022-12-14 12:00:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3208191126279862) internal successors, (973), 293 states have internal predecessors, (973), 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-12-14 12:00:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 973 transitions. [2022-12-14 12:00:18,127 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 973 transitions. Word has length 24 [2022-12-14 12:00:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:18,127 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 973 transitions. [2022-12-14 12:00:18,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 973 transitions. [2022-12-14 12:00:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:18,128 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:18,128 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:18,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2022-12-14 12:00:18,128 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1522611433, now seen corresponding path program 70 times [2022-12-14 12:00:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:18,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204408445] [2022-12-14 12:00:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:18,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:18,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204408445] [2022-12-14 12:00:18,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204408445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:18,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:18,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572625920] [2022-12-14 12:00:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:18,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:18,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:18,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:18,377 INFO L87 Difference]: Start difference. First operand 294 states and 973 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:18,617 INFO L93 Difference]: Finished difference Result 476 states and 1465 transitions. [2022-12-14 12:00:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:18,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:18,618 INFO L225 Difference]: With dead ends: 476 [2022-12-14 12:00:18,618 INFO L226 Difference]: Without dead ends: 468 [2022-12-14 12:00:18,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:18,618 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:18,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-12-14 12:00:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 296. [2022-12-14 12:00:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3152542372881357) internal successors, (978), 295 states have internal predecessors, (978), 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-12-14 12:00:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 978 transitions. [2022-12-14 12:00:18,623 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 978 transitions. Word has length 24 [2022-12-14 12:00:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:18,623 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 978 transitions. [2022-12-14 12:00:18,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 978 transitions. [2022-12-14 12:00:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:18,623 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:18,623 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:18,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2022-12-14 12:00:18,623 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash 472344497, now seen corresponding path program 71 times [2022-12-14 12:00:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:18,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496372404] [2022-12-14 12:00:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:18,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:18,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496372404] [2022-12-14 12:00:18,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496372404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:18,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:18,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878129952] [2022-12-14 12:00:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:18,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:18,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:18,839 INFO L87 Difference]: Start difference. First operand 296 states and 978 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:19,075 INFO L93 Difference]: Finished difference Result 474 states and 1470 transitions. [2022-12-14 12:00:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:19,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:19,076 INFO L225 Difference]: With dead ends: 474 [2022-12-14 12:00:19,076 INFO L226 Difference]: Without dead ends: 474 [2022-12-14 12:00:19,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:19,076 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:19,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-12-14 12:00:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 298. [2022-12-14 12:00:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.3164983164983166) internal successors, (985), 297 states have internal predecessors, (985), 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-12-14 12:00:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 985 transitions. [2022-12-14 12:00:19,081 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 985 transitions. Word has length 24 [2022-12-14 12:00:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:19,081 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 985 transitions. [2022-12-14 12:00:19,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 985 transitions. [2022-12-14 12:00:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:19,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:19,082 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:19,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2022-12-14 12:00:19,082 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:19,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash 992087573, now seen corresponding path program 72 times [2022-12-14 12:00:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:19,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256421727] [2022-12-14 12:00:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:19,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:19,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256421727] [2022-12-14 12:00:19,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256421727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:19,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:19,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:19,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702099985] [2022-12-14 12:00:19,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:19,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:19,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:19,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:19,312 INFO L87 Difference]: Start difference. First operand 298 states and 985 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:19,541 INFO L93 Difference]: Finished difference Result 462 states and 1448 transitions. [2022-12-14 12:00:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:19,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:19,542 INFO L225 Difference]: With dead ends: 462 [2022-12-14 12:00:19,542 INFO L226 Difference]: Without dead ends: 458 [2022-12-14 12:00:19,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:19,542 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:19,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-12-14 12:00:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 294. [2022-12-14 12:00:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3208191126279862) internal successors, (973), 293 states have internal predecessors, (973), 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-12-14 12:00:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 973 transitions. [2022-12-14 12:00:19,547 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 973 transitions. Word has length 24 [2022-12-14 12:00:19,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:19,547 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 973 transitions. [2022-12-14 12:00:19,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 973 transitions. [2022-12-14 12:00:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:19,548 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:19,548 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:19,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2022-12-14 12:00:19,548 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:19,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1207607137, now seen corresponding path program 73 times [2022-12-14 12:00:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:19,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076867988] [2022-12-14 12:00:19,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:19,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:19,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076867988] [2022-12-14 12:00:19,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076867988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:19,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:19,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:19,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437493610] [2022-12-14 12:00:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:19,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:19,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:19,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:19,801 INFO L87 Difference]: Start difference. First operand 294 states and 973 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:19,938 INFO L93 Difference]: Finished difference Result 514 states and 1612 transitions. [2022-12-14 12:00:19,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:19,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:19,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:19,939 INFO L225 Difference]: With dead ends: 514 [2022-12-14 12:00:19,939 INFO L226 Difference]: Without dead ends: 514 [2022-12-14 12:00:19,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:19,939 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:19,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-12-14 12:00:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 300. [2022-12-14 12:00:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.37123745819398) internal successors, (1008), 299 states have internal predecessors, (1008), 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-12-14 12:00:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1008 transitions. [2022-12-14 12:00:19,944 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1008 transitions. Word has length 24 [2022-12-14 12:00:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:19,944 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1008 transitions. [2022-12-14 12:00:19,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1008 transitions. [2022-12-14 12:00:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:19,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:19,945 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:19,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2022-12-14 12:00:19,945 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:19,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1303292025, now seen corresponding path program 74 times [2022-12-14 12:00:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:19,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761765690] [2022-12-14 12:00:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:20,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:20,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761765690] [2022-12-14 12:00:20,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761765690] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:20,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654583009] [2022-12-14 12:00:20,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:00:20,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:20,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:20,255 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:20,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 12:00:20,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:00:20,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:00:20,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 12:00:20,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:20,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:00:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:20,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654583009] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:20,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 12:00:20,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2022-12-14 12:00:20,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882369239] [2022-12-14 12:00:20,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:20,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:20,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:20,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-14 12:00:20,808 INFO L87 Difference]: Start difference. First operand 300 states and 1008 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:21,042 INFO L93 Difference]: Finished difference Result 508 states and 1596 transitions. [2022-12-14 12:00:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:21,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:21,043 INFO L225 Difference]: With dead ends: 508 [2022-12-14 12:00:21,043 INFO L226 Difference]: Without dead ends: 508 [2022-12-14 12:00:21,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-12-14 12:00:21,043 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:21,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-12-14 12:00:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 296. [2022-12-14 12:00:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3423728813559324) internal successors, (986), 295 states have internal predecessors, (986), 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-12-14 12:00:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 986 transitions. [2022-12-14 12:00:21,048 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 986 transitions. Word has length 24 [2022-12-14 12:00:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:21,048 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 986 transitions. [2022-12-14 12:00:21,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 986 transitions. [2022-12-14 12:00:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:21,049 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:21,049 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:21,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 12:00:21,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:21,250 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash 814580127, now seen corresponding path program 67 times [2022-12-14 12:00:21,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:21,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655116507] [2022-12-14 12:00:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:21,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:21,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655116507] [2022-12-14 12:00:21,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655116507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:21,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:21,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526689513] [2022-12-14 12:00:21,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:21,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:21,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:21,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:21,528 INFO L87 Difference]: Start difference. First operand 296 states and 986 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:21,707 INFO L93 Difference]: Finished difference Result 508 states and 1647 transitions. [2022-12-14 12:00:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:21,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:21,708 INFO L225 Difference]: With dead ends: 508 [2022-12-14 12:00:21,708 INFO L226 Difference]: Without dead ends: 508 [2022-12-14 12:00:21,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:21,709 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:21,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-12-14 12:00:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 300. [2022-12-14 12:00:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.37123745819398) internal successors, (1008), 299 states have internal predecessors, (1008), 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-12-14 12:00:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1008 transitions. [2022-12-14 12:00:21,716 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1008 transitions. Word has length 24 [2022-12-14 12:00:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:21,716 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1008 transitions. [2022-12-14 12:00:21,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1008 transitions. [2022-12-14 12:00:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:21,716 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:21,716 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:21,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2022-12-14 12:00:21,717 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:21,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:21,717 INFO L85 PathProgramCache]: Analyzing trace with hash 700224861, now seen corresponding path program 68 times [2022-12-14 12:00:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:21,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120241225] [2022-12-14 12:00:21,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:21,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:22,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:22,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120241225] [2022-12-14 12:00:22,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120241225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:22,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:22,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096870968] [2022-12-14 12:00:22,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:22,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:22,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:22,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:22,020 INFO L87 Difference]: Start difference. First operand 300 states and 1008 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:22,150 INFO L93 Difference]: Finished difference Result 500 states and 1623 transitions. [2022-12-14 12:00:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:22,152 INFO L225 Difference]: With dead ends: 500 [2022-12-14 12:00:22,152 INFO L226 Difference]: Without dead ends: 500 [2022-12-14 12:00:22,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:22,152 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:22,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-12-14 12:00:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 296. [2022-12-14 12:00:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3423728813559324) internal successors, (986), 295 states have internal predecessors, (986), 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-12-14 12:00:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 986 transitions. [2022-12-14 12:00:22,156 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 986 transitions. Word has length 24 [2022-12-14 12:00:22,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:22,157 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 986 transitions. [2022-12-14 12:00:22,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 986 transitions. [2022-12-14 12:00:22,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:22,157 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:22,157 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:22,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2022-12-14 12:00:22,157 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:22,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 139773309, now seen corresponding path program 75 times [2022-12-14 12:00:22,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:22,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132309221] [2022-12-14 12:00:22,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:22,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:22,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132309221] [2022-12-14 12:00:22,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132309221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:22,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:22,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:22,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516354743] [2022-12-14 12:00:22,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:22,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:22,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:22,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:22,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:22,382 INFO L87 Difference]: Start difference. First operand 296 states and 986 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:22,607 INFO L93 Difference]: Finished difference Result 518 states and 1617 transitions. [2022-12-14 12:00:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:22,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:22,609 INFO L225 Difference]: With dead ends: 518 [2022-12-14 12:00:22,609 INFO L226 Difference]: Without dead ends: 518 [2022-12-14 12:00:22,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:22,609 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:22,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-12-14 12:00:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 300. [2022-12-14 12:00:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.3612040133779266) internal successors, (1005), 299 states have internal predecessors, (1005), 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-12-14 12:00:22,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1005 transitions. [2022-12-14 12:00:22,614 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1005 transitions. Word has length 24 [2022-12-14 12:00:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:22,614 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1005 transitions. [2022-12-14 12:00:22,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1005 transitions. [2022-12-14 12:00:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:22,614 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:22,614 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:22,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2022-12-14 12:00:22,614 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:22,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash -483464675, now seen corresponding path program 69 times [2022-12-14 12:00:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:22,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136627076] [2022-12-14 12:00:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:22,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:22,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136627076] [2022-12-14 12:00:22,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136627076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:22,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:22,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208353745] [2022-12-14 12:00:22,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:22,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:22,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:22,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:22,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:22,888 INFO L87 Difference]: Start difference. First operand 300 states and 1005 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:23,101 INFO L93 Difference]: Finished difference Result 518 states and 1634 transitions. [2022-12-14 12:00:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:23,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:23,103 INFO L225 Difference]: With dead ends: 518 [2022-12-14 12:00:23,103 INFO L226 Difference]: Without dead ends: 518 [2022-12-14 12:00:23,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:23,103 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:23,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-12-14 12:00:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 300. [2022-12-14 12:00:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.3612040133779266) internal successors, (1005), 299 states have internal predecessors, (1005), 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-12-14 12:00:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1005 transitions. [2022-12-14 12:00:23,108 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1005 transitions. Word has length 24 [2022-12-14 12:00:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:23,108 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1005 transitions. [2022-12-14 12:00:23,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1005 transitions. [2022-12-14 12:00:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:23,108 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:23,109 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:23,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2022-12-14 12:00:23,109 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:23,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2027153209, now seen corresponding path program 70 times [2022-12-14 12:00:23,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:23,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267213214] [2022-12-14 12:00:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:23,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:23,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267213214] [2022-12-14 12:00:23,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267213214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:23,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:23,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:23,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314140623] [2022-12-14 12:00:23,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:23,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:23,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:23,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:23,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:23,338 INFO L87 Difference]: Start difference. First operand 300 states and 1005 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:23,583 INFO L93 Difference]: Finished difference Result 464 states and 1500 transitions. [2022-12-14 12:00:23,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:23,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:23,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:23,584 INFO L225 Difference]: With dead ends: 464 [2022-12-14 12:00:23,584 INFO L226 Difference]: Without dead ends: 458 [2022-12-14 12:00:23,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:23,584 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:23,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-12-14 12:00:23,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 300. [2022-12-14 12:00:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.347826086956522) internal successors, (1001), 299 states have internal predecessors, (1001), 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-12-14 12:00:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1001 transitions. [2022-12-14 12:00:23,588 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1001 transitions. Word has length 24 [2022-12-14 12:00:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:23,588 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1001 transitions. [2022-12-14 12:00:23,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1001 transitions. [2022-12-14 12:00:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:23,589 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:23,589 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:23,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2022-12-14 12:00:23,589 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:23,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1681532439, now seen corresponding path program 76 times [2022-12-14 12:00:23,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:23,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458675709] [2022-12-14 12:00:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:23,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:23,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458675709] [2022-12-14 12:00:23,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458675709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:23,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:23,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093051019] [2022-12-14 12:00:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:23,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:23,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:23,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:23,868 INFO L87 Difference]: Start difference. First operand 300 states and 1001 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:24,134 INFO L93 Difference]: Finished difference Result 490 states and 1546 transitions. [2022-12-14 12:00:24,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:24,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:24,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:24,135 INFO L225 Difference]: With dead ends: 490 [2022-12-14 12:00:24,136 INFO L226 Difference]: Without dead ends: 486 [2022-12-14 12:00:24,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:24,136 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:24,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-12-14 12:00:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 296. [2022-12-14 12:00:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3423728813559324) internal successors, (986), 295 states have internal predecessors, (986), 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-12-14 12:00:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 986 transitions. [2022-12-14 12:00:24,141 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 986 transitions. Word has length 24 [2022-12-14 12:00:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:24,141 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 986 transitions. [2022-12-14 12:00:24,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 986 transitions. [2022-12-14 12:00:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:24,142 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:24,142 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:24,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2022-12-14 12:00:24,142 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:24,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash -367608967, now seen corresponding path program 71 times [2022-12-14 12:00:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:24,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252515867] [2022-12-14 12:00:24,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:24,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:24,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252515867] [2022-12-14 12:00:24,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252515867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:24,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:24,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231548431] [2022-12-14 12:00:24,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:24,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:24,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:24,382 INFO L87 Difference]: Start difference. First operand 296 states and 986 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:24,544 INFO L93 Difference]: Finished difference Result 450 states and 1460 transitions. [2022-12-14 12:00:24,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:24,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:24,545 INFO L225 Difference]: With dead ends: 450 [2022-12-14 12:00:24,545 INFO L226 Difference]: Without dead ends: 450 [2022-12-14 12:00:24,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:24,546 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:24,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-12-14 12:00:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 298. [2022-12-14 12:00:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.3434343434343434) internal successors, (993), 297 states have internal predecessors, (993), 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-12-14 12:00:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 993 transitions. [2022-12-14 12:00:24,550 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 993 transitions. Word has length 24 [2022-12-14 12:00:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:24,550 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 993 transitions. [2022-12-14 12:00:24,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 993 transitions. [2022-12-14 12:00:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:24,551 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:24,551 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:24,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2022-12-14 12:00:24,551 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1517860037, now seen corresponding path program 72 times [2022-12-14 12:00:24,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:24,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56039108] [2022-12-14 12:00:24,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:24,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:24,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:24,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56039108] [2022-12-14 12:00:24,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56039108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:24,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:24,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782146569] [2022-12-14 12:00:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:24,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:24,791 INFO L87 Difference]: Start difference. First operand 298 states and 993 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:25,044 INFO L93 Difference]: Finished difference Result 428 states and 1410 transitions. [2022-12-14 12:00:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:25,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:25,045 INFO L225 Difference]: With dead ends: 428 [2022-12-14 12:00:25,045 INFO L226 Difference]: Without dead ends: 422 [2022-12-14 12:00:25,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:25,046 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:25,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-12-14 12:00:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 296. [2022-12-14 12:00:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3423728813559324) internal successors, (986), 295 states have internal predecessors, (986), 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-12-14 12:00:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 986 transitions. [2022-12-14 12:00:25,052 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 986 transitions. Word has length 24 [2022-12-14 12:00:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:25,052 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 986 transitions. [2022-12-14 12:00:25,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 986 transitions. [2022-12-14 12:00:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:25,052 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:25,052 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:25,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2022-12-14 12:00:25,053 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:25,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1963840029, now seen corresponding path program 77 times [2022-12-14 12:00:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:25,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822282411] [2022-12-14 12:00:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:25,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:25,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822282411] [2022-12-14 12:00:25,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822282411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:25,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:25,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:25,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224246843] [2022-12-14 12:00:25,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:25,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:25,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:25,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:25,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:25,292 INFO L87 Difference]: Start difference. First operand 296 states and 986 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:25,594 INFO L93 Difference]: Finished difference Result 534 states and 1631 transitions. [2022-12-14 12:00:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 12:00:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:25,595 INFO L225 Difference]: With dead ends: 534 [2022-12-14 12:00:25,595 INFO L226 Difference]: Without dead ends: 534 [2022-12-14 12:00:25,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-12-14 12:00:25,595 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:25,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-12-14 12:00:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 298. [2022-12-14 12:00:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.3434343434343434) internal successors, (993), 297 states have internal predecessors, (993), 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-12-14 12:00:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 993 transitions. [2022-12-14 12:00:25,600 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 993 transitions. Word has length 24 [2022-12-14 12:00:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:25,600 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 993 transitions. [2022-12-14 12:00:25,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 993 transitions. [2022-12-14 12:00:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:25,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:25,601 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:25,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2022-12-14 12:00:25,601 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:25,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1811384191, now seen corresponding path program 78 times [2022-12-14 12:00:25,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:25,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321947678] [2022-12-14 12:00:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:25,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:25,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:25,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321947678] [2022-12-14 12:00:25,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321947678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:25,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:25,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138465958] [2022-12-14 12:00:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:25,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:25,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:25,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:25,844 INFO L87 Difference]: Start difference. First operand 298 states and 993 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:26,184 INFO L93 Difference]: Finished difference Result 474 states and 1479 transitions. [2022-12-14 12:00:26,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 12:00:26,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:26,185 INFO L225 Difference]: With dead ends: 474 [2022-12-14 12:00:26,185 INFO L226 Difference]: Without dead ends: 470 [2022-12-14 12:00:26,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-12-14 12:00:26,185 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:26,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-12-14 12:00:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 292. [2022-12-14 12:00:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3058419243986252) internal successors, (962), 291 states have internal predecessors, (962), 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-12-14 12:00:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 962 transitions. [2022-12-14 12:00:26,190 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 962 transitions. Word has length 24 [2022-12-14 12:00:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:26,190 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 962 transitions. [2022-12-14 12:00:26,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 962 transitions. [2022-12-14 12:00:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:26,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:26,190 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:26,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2022-12-14 12:00:26,190 INFO L420 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:26,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash 865766963, now seen corresponding path program 79 times [2022-12-14 12:00:26,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:26,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254565530] [2022-12-14 12:00:26,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:26,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:26,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:26,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254565530] [2022-12-14 12:00:26,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254565530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:26,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:26,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263474747] [2022-12-14 12:00:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:26,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:26,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:26,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:26,402 INFO L87 Difference]: Start difference. First operand 292 states and 962 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:26,615 INFO L93 Difference]: Finished difference Result 454 states and 1423 transitions. [2022-12-14 12:00:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:26,616 INFO L225 Difference]: With dead ends: 454 [2022-12-14 12:00:26,616 INFO L226 Difference]: Without dead ends: 454 [2022-12-14 12:00:26,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:26,616 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:26,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-12-14 12:00:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 296. [2022-12-14 12:00:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3220338983050848) internal successors, (980), 295 states have internal predecessors, (980), 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-12-14 12:00:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 980 transitions. [2022-12-14 12:00:26,621 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 980 transitions. Word has length 24 [2022-12-14 12:00:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:26,621 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 980 transitions. [2022-12-14 12:00:26,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 980 transitions. [2022-12-14 12:00:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:26,621 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:26,621 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:26,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2022-12-14 12:00:26,622 INFO L420 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2090255091, now seen corresponding path program 80 times [2022-12-14 12:00:26,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:26,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734453557] [2022-12-14 12:00:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:26,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:26,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:26,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734453557] [2022-12-14 12:00:26,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734453557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:26,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:26,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203281921] [2022-12-14 12:00:26,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:26,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:26,844 INFO L87 Difference]: Start difference. First operand 296 states and 980 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:26,984 INFO L93 Difference]: Finished difference Result 488 states and 1516 transitions. [2022-12-14 12:00:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:26,985 INFO L225 Difference]: With dead ends: 488 [2022-12-14 12:00:26,985 INFO L226 Difference]: Without dead ends: 488 [2022-12-14 12:00:26,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:26,985 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:26,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-12-14 12:00:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 300. [2022-12-14 12:00:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.351170568561873) internal successors, (1002), 299 states have internal predecessors, (1002), 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-12-14 12:00:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1002 transitions. [2022-12-14 12:00:26,990 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1002 transitions. Word has length 24 [2022-12-14 12:00:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:26,990 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1002 transitions. [2022-12-14 12:00:26,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1002 transitions. [2022-12-14 12:00:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:26,991 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:26,991 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:26,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2022-12-14 12:00:26,991 INFO L420 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:26,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash -191831691, now seen corresponding path program 81 times [2022-12-14 12:00:26,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:26,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507296624] [2022-12-14 12:00:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:27,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:27,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507296624] [2022-12-14 12:00:27,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507296624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:27,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:27,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:27,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489957303] [2022-12-14 12:00:27,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:27,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:27,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:27,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:27,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:27,213 INFO L87 Difference]: Start difference. First operand 300 states and 1002 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:27,393 INFO L93 Difference]: Finished difference Result 464 states and 1461 transitions. [2022-12-14 12:00:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:27,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:27,394 INFO L225 Difference]: With dead ends: 464 [2022-12-14 12:00:27,394 INFO L226 Difference]: Without dead ends: 464 [2022-12-14 12:00:27,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:27,394 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:27,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-12-14 12:00:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 292. [2022-12-14 12:00:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3058419243986252) internal successors, (962), 291 states have internal predecessors, (962), 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-12-14 12:00:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 962 transitions. [2022-12-14 12:00:27,398 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 962 transitions. Word has length 24 [2022-12-14 12:00:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:27,398 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 962 transitions. [2022-12-14 12:00:27,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 962 transitions. [2022-12-14 12:00:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:27,399 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:27,399 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:27,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2022-12-14 12:00:27,399 INFO L420 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1566831541, now seen corresponding path program 73 times [2022-12-14 12:00:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:27,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462739565] [2022-12-14 12:00:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:27,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:27,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:27,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462739565] [2022-12-14 12:00:27,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462739565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:27,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:27,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:27,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919741848] [2022-12-14 12:00:27,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:27,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:27,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:27,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:27,610 INFO L87 Difference]: Start difference. First operand 292 states and 962 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:27,733 INFO L93 Difference]: Finished difference Result 474 states and 1518 transitions. [2022-12-14 12:00:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:27,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:27,734 INFO L225 Difference]: With dead ends: 474 [2022-12-14 12:00:27,734 INFO L226 Difference]: Without dead ends: 474 [2022-12-14 12:00:27,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:27,734 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:27,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-12-14 12:00:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 296. [2022-12-14 12:00:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3220338983050848) internal successors, (980), 295 states have internal predecessors, (980), 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-12-14 12:00:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 980 transitions. [2022-12-14 12:00:27,739 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 980 transitions. Word has length 24 [2022-12-14 12:00:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:27,739 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 980 transitions. [2022-12-14 12:00:27,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 980 transitions. [2022-12-14 12:00:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:27,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:27,740 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:27,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2022-12-14 12:00:27,740 INFO L420 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1622316853, now seen corresponding path program 74 times [2022-12-14 12:00:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:27,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901932645] [2022-12-14 12:00:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:27,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:27,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901932645] [2022-12-14 12:00:27,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901932645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:27,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:27,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589651624] [2022-12-14 12:00:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:27,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:27,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:27,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:27,964 INFO L87 Difference]: Start difference. First operand 296 states and 980 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:28,110 INFO L93 Difference]: Finished difference Result 482 states and 1566 transitions. [2022-12-14 12:00:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:28,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:28,111 INFO L225 Difference]: With dead ends: 482 [2022-12-14 12:00:28,111 INFO L226 Difference]: Without dead ends: 482 [2022-12-14 12:00:28,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:28,111 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:28,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-12-14 12:00:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 300. [2022-12-14 12:00:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.351170568561873) internal successors, (1002), 299 states have internal predecessors, (1002), 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-12-14 12:00:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1002 transitions. [2022-12-14 12:00:28,115 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 1002 transitions. Word has length 24 [2022-12-14 12:00:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:28,116 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 1002 transitions. [2022-12-14 12:00:28,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 1002 transitions. [2022-12-14 12:00:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:28,116 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:28,116 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:28,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2022-12-14 12:00:28,116 INFO L420 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:28,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1013771337, now seen corresponding path program 75 times [2022-12-14 12:00:28,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:28,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449377740] [2022-12-14 12:00:28,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:28,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:28,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:28,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449377740] [2022-12-14 12:00:28,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449377740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:28,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:28,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634980199] [2022-12-14 12:00:28,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:28,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:28,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:28,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:28,345 INFO L87 Difference]: Start difference. First operand 300 states and 1002 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:28,640 INFO L93 Difference]: Finished difference Result 482 states and 1564 transitions. [2022-12-14 12:00:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:28,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:28,641 INFO L225 Difference]: With dead ends: 482 [2022-12-14 12:00:28,641 INFO L226 Difference]: Without dead ends: 482 [2022-12-14 12:00:28,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:28,642 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:28,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-12-14 12:00:28,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 292. [2022-12-14 12:00:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3058419243986252) internal successors, (962), 291 states have internal predecessors, (962), 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-12-14 12:00:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 962 transitions. [2022-12-14 12:00:28,646 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 962 transitions. Word has length 24 [2022-12-14 12:00:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:28,646 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 962 transitions. [2022-12-14 12:00:28,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:28,646 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 962 transitions. [2022-12-14 12:00:28,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:28,647 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:28,647 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:28,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2022-12-14 12:00:28,647 INFO L420 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:28,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1471246055, now seen corresponding path program 76 times [2022-12-14 12:00:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:28,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889158810] [2022-12-14 12:00:28,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:28,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:28,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:28,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889158810] [2022-12-14 12:00:28,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889158810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:28,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:28,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348577909] [2022-12-14 12:00:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:28,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:28,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:28,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:28,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:28,857 INFO L87 Difference]: Start difference. First operand 292 states and 962 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:28,971 INFO L93 Difference]: Finished difference Result 412 states and 1318 transitions. [2022-12-14 12:00:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:28,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:28,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:28,972 INFO L225 Difference]: With dead ends: 412 [2022-12-14 12:00:28,972 INFO L226 Difference]: Without dead ends: 412 [2022-12-14 12:00:28,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:28,972 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:28,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-12-14 12:00:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 292. [2022-12-14 12:00:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3058419243986252) internal successors, (962), 291 states have internal predecessors, (962), 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-12-14 12:00:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 962 transitions. [2022-12-14 12:00:28,976 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 962 transitions. Word has length 24 [2022-12-14 12:00:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:28,976 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 962 transitions. [2022-12-14 12:00:28,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 962 transitions. [2022-12-14 12:00:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:28,977 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:28,977 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:28,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2022-12-14 12:00:28,977 INFO L420 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:28,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash 911901031, now seen corresponding path program 77 times [2022-12-14 12:00:28,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:28,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842925021] [2022-12-14 12:00:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:29,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:29,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842925021] [2022-12-14 12:00:29,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842925021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:29,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:29,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621841490] [2022-12-14 12:00:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:29,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:29,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:29,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:29,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:29,202 INFO L87 Difference]: Start difference. First operand 292 states and 962 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:29,342 INFO L93 Difference]: Finished difference Result 408 states and 1302 transitions. [2022-12-14 12:00:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:29,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:29,343 INFO L225 Difference]: With dead ends: 408 [2022-12-14 12:00:29,343 INFO L226 Difference]: Without dead ends: 408 [2022-12-14 12:00:29,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:29,343 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:29,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-12-14 12:00:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 294. [2022-12-14 12:00:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3071672354948807) internal successors, (969), 293 states have internal predecessors, (969), 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-12-14 12:00:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 969 transitions. [2022-12-14 12:00:29,347 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 969 transitions. Word has length 24 [2022-12-14 12:00:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:29,347 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 969 transitions. [2022-12-14 12:00:29,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 969 transitions. [2022-12-14 12:00:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:29,348 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:29,348 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:29,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2022-12-14 12:00:29,348 INFO L420 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:29,348 INFO L85 PathProgramCache]: Analyzing trace with hash -238350039, now seen corresponding path program 78 times [2022-12-14 12:00:29,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:29,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968752692] [2022-12-14 12:00:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:29,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:29,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968752692] [2022-12-14 12:00:29,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968752692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:29,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:29,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:29,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743320584] [2022-12-14 12:00:29,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:29,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:29,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:29,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:29,568 INFO L87 Difference]: Start difference. First operand 294 states and 969 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:29,701 INFO L93 Difference]: Finished difference Result 386 states and 1252 transitions. [2022-12-14 12:00:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:29,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:29,702 INFO L225 Difference]: With dead ends: 386 [2022-12-14 12:00:29,702 INFO L226 Difference]: Without dead ends: 380 [2022-12-14 12:00:29,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:29,702 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:29,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-12-14 12:00:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 290. [2022-12-14 12:00:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.311418685121107) internal successors, (957), 289 states have internal predecessors, (957), 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-12-14 12:00:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 957 transitions. [2022-12-14 12:00:29,706 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 957 transitions. Word has length 24 [2022-12-14 12:00:29,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:29,706 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 957 transitions. [2022-12-14 12:00:29,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 957 transitions. [2022-12-14 12:00:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:29,706 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:29,707 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:29,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2022-12-14 12:00:29,707 INFO L420 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:29,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:29,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1046709733, now seen corresponding path program 82 times [2022-12-14 12:00:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:29,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525525135] [2022-12-14 12:00:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:29,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:29,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:29,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525525135] [2022-12-14 12:00:29,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525525135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:29,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:29,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 12:00:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006996918] [2022-12-14 12:00:29,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:29,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 12:00:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:29,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 12:00:29,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:29,947 INFO L87 Difference]: Start difference. First operand 290 states and 957 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:30,093 INFO L93 Difference]: Finished difference Result 484 states and 1493 transitions. [2022-12-14 12:00:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:30,095 INFO L225 Difference]: With dead ends: 484 [2022-12-14 12:00:30,095 INFO L226 Difference]: Without dead ends: 484 [2022-12-14 12:00:30,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:30,095 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:30,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-12-14 12:00:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 290. [2022-12-14 12:00:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.311418685121107) internal successors, (957), 289 states have internal predecessors, (957), 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-12-14 12:00:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 957 transitions. [2022-12-14 12:00:30,099 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 957 transitions. Word has length 24 [2022-12-14 12:00:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:30,099 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 957 transitions. [2022-12-14 12:00:30,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 957 transitions. [2022-12-14 12:00:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:30,100 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:30,100 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:30,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2022-12-14 12:00:30,100 INFO L420 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1557963535, now seen corresponding path program 83 times [2022-12-14 12:00:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:30,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691016694] [2022-12-14 12:00:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:30,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:30,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691016694] [2022-12-14 12:00:30,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691016694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:30,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:30,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:30,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280413247] [2022-12-14 12:00:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:30,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:30,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:30,332 INFO L87 Difference]: Start difference. First operand 290 states and 957 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:30,455 INFO L93 Difference]: Finished difference Result 478 states and 1473 transitions. [2022-12-14 12:00:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:30,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:30,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:30,456 INFO L225 Difference]: With dead ends: 478 [2022-12-14 12:00:30,456 INFO L226 Difference]: Without dead ends: 478 [2022-12-14 12:00:30,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:30,456 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:30,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:30,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-12-14 12:00:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 292. [2022-12-14 12:00:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3127147766323026) internal successors, (964), 291 states have internal predecessors, (964), 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-12-14 12:00:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 964 transitions. [2022-12-14 12:00:30,461 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 964 transitions. Word has length 24 [2022-12-14 12:00:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:30,461 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 964 transitions. [2022-12-14 12:00:30,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 964 transitions. [2022-12-14 12:00:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:30,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:30,461 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:30,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2022-12-14 12:00:30,461 INFO L420 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:30,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1038220459, now seen corresponding path program 84 times [2022-12-14 12:00:30,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:30,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377772131] [2022-12-14 12:00:30,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:30,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:30,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:30,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377772131] [2022-12-14 12:00:30,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377772131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:30,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:30,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207879404] [2022-12-14 12:00:30,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:30,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:30,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:30,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:30,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:30,700 INFO L87 Difference]: Start difference. First operand 292 states and 964 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:30,889 INFO L93 Difference]: Finished difference Result 458 states and 1431 transitions. [2022-12-14 12:00:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:30,890 INFO L225 Difference]: With dead ends: 458 [2022-12-14 12:00:30,890 INFO L226 Difference]: Without dead ends: 454 [2022-12-14 12:00:30,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:30,890 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:30,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-12-14 12:00:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 288. [2022-12-14 12:00:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.317073170731707) internal successors, (952), 287 states have internal predecessors, (952), 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-12-14 12:00:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 952 transitions. [2022-12-14 12:00:30,895 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 952 transitions. Word has length 24 [2022-12-14 12:00:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:30,895 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 952 transitions. [2022-12-14 12:00:30,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 952 transitions. [2022-12-14 12:00:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:30,895 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:30,895 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:30,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2022-12-14 12:00:30,895 INFO L420 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:30,896 INFO L85 PathProgramCache]: Analyzing trace with hash -759253769, now seen corresponding path program 85 times [2022-12-14 12:00:30,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:30,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126340300] [2022-12-14 12:00:30,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:30,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:31,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:31,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126340300] [2022-12-14 12:00:31,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126340300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:31,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:31,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411576360] [2022-12-14 12:00:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:31,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:31,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:31,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:31,186 INFO L87 Difference]: Start difference. First operand 288 states and 952 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:31,430 INFO L93 Difference]: Finished difference Result 530 states and 1674 transitions. [2022-12-14 12:00:31,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:31,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:31,431 INFO L225 Difference]: With dead ends: 530 [2022-12-14 12:00:31,431 INFO L226 Difference]: Without dead ends: 530 [2022-12-14 12:00:31,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-14 12:00:31,432 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:31,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-12-14 12:00:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 294. [2022-12-14 12:00:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.368600682593857) internal successors, (987), 293 states have internal predecessors, (987), 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-12-14 12:00:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 987 transitions. [2022-12-14 12:00:31,436 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 987 transitions. Word has length 24 [2022-12-14 12:00:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:31,436 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 987 transitions. [2022-12-14 12:00:31,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 987 transitions. [2022-12-14 12:00:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:31,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:31,437 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:31,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2022-12-14 12:00:31,437 INFO L420 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:31,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1024814365, now seen corresponding path program 86 times [2022-12-14 12:00:31,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:31,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154951937] [2022-12-14 12:00:31,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:31,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:31,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:31,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154951937] [2022-12-14 12:00:31,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154951937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:31,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:31,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:31,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603746520] [2022-12-14 12:00:31,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:31,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:31,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:31,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:31,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:31,678 INFO L87 Difference]: Start difference. First operand 294 states and 987 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:32,028 INFO L93 Difference]: Finished difference Result 564 states and 1733 transitions. [2022-12-14 12:00:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 12:00:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:32,029 INFO L225 Difference]: With dead ends: 564 [2022-12-14 12:00:32,029 INFO L226 Difference]: Without dead ends: 564 [2022-12-14 12:00:32,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-12-14 12:00:32,029 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:32,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-12-14 12:00:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 290. [2022-12-14 12:00:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.339100346020761) internal successors, (965), 289 states have internal predecessors, (965), 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-12-14 12:00:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 965 transitions. [2022-12-14 12:00:32,034 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 965 transitions. Word has length 24 [2022-12-14 12:00:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:32,034 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 965 transitions. [2022-12-14 12:00:32,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 965 transitions. [2022-12-14 12:00:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:32,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:32,035 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:32,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2022-12-14 12:00:32,035 INFO L420 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:32,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1152280779, now seen corresponding path program 79 times [2022-12-14 12:00:32,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:32,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792932346] [2022-12-14 12:00:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:32,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:32,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792932346] [2022-12-14 12:00:32,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792932346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:32,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:32,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713118493] [2022-12-14 12:00:32,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:32,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:32,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:32,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:32,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:32,284 INFO L87 Difference]: Start difference. First operand 290 states and 965 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:32,599 INFO L93 Difference]: Finished difference Result 484 states and 1558 transitions. [2022-12-14 12:00:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:32,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:32,600 INFO L225 Difference]: With dead ends: 484 [2022-12-14 12:00:32,600 INFO L226 Difference]: Without dead ends: 484 [2022-12-14 12:00:32,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:32,601 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:32,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-12-14 12:00:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 294. [2022-12-14 12:00:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.368600682593857) internal successors, (987), 293 states have internal predecessors, (987), 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-12-14 12:00:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 987 transitions. [2022-12-14 12:00:32,605 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 987 transitions. Word has length 24 [2022-12-14 12:00:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:32,605 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 987 transitions. [2022-12-14 12:00:32,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 987 transitions. [2022-12-14 12:00:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:32,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:32,606 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:32,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2022-12-14 12:00:32,606 INFO L420 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1266636045, now seen corresponding path program 80 times [2022-12-14 12:00:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:32,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473097562] [2022-12-14 12:00:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:32,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:32,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:32,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473097562] [2022-12-14 12:00:32,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473097562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:32,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:32,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:32,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684655999] [2022-12-14 12:00:32,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:32,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:32,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:32,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:32,863 INFO L87 Difference]: Start difference. First operand 294 states and 987 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:33,191 INFO L93 Difference]: Finished difference Result 476 states and 1534 transitions. [2022-12-14 12:00:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:33,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:33,192 INFO L225 Difference]: With dead ends: 476 [2022-12-14 12:00:33,192 INFO L226 Difference]: Without dead ends: 476 [2022-12-14 12:00:33,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:33,192 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:33,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-12-14 12:00:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 290. [2022-12-14 12:00:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.339100346020761) internal successors, (965), 289 states have internal predecessors, (965), 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-12-14 12:00:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 965 transitions. [2022-12-14 12:00:33,196 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 965 transitions. Word has length 24 [2022-12-14 12:00:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:33,197 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 965 transitions. [2022-12-14 12:00:33,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 965 transitions. [2022-12-14 12:00:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:33,200 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:33,200 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:33,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2022-12-14 12:00:33,200 INFO L420 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:33,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1827087597, now seen corresponding path program 87 times [2022-12-14 12:00:33,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:33,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203935966] [2022-12-14 12:00:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:33,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:33,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203935966] [2022-12-14 12:00:33,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203935966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:33,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:33,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 12:00:33,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176023326] [2022-12-14 12:00:33,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:33,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 12:00:33,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 12:00:33,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:33,449 INFO L87 Difference]: Start difference. First operand 290 states and 965 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:33,690 INFO L93 Difference]: Finished difference Result 466 states and 1491 transitions. [2022-12-14 12:00:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 12:00:33,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:33,691 INFO L225 Difference]: With dead ends: 466 [2022-12-14 12:00:33,691 INFO L226 Difference]: Without dead ends: 466 [2022-12-14 12:00:33,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:33,691 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:33,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:33,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-12-14 12:00:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 294. [2022-12-14 12:00:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.358361774744027) internal successors, (984), 293 states have internal predecessors, (984), 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-12-14 12:00:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 984 transitions. [2022-12-14 12:00:33,696 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 984 transitions. Word has length 24 [2022-12-14 12:00:33,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:33,696 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 984 transitions. [2022-12-14 12:00:33,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 984 transitions. [2022-12-14 12:00:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:33,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:33,697 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:33,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2022-12-14 12:00:33,697 INFO L420 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:33,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1844641715, now seen corresponding path program 81 times [2022-12-14 12:00:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:33,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490773696] [2022-12-14 12:00:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:33,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:33,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490773696] [2022-12-14 12:00:33,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490773696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:33,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:33,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:33,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899514867] [2022-12-14 12:00:33,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:33,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:33,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:33,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:33,935 INFO L87 Difference]: Start difference. First operand 294 states and 984 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:34,085 INFO L93 Difference]: Finished difference Result 456 states and 1452 transitions. [2022-12-14 12:00:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:34,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:34,086 INFO L225 Difference]: With dead ends: 456 [2022-12-14 12:00:34,086 INFO L226 Difference]: Without dead ends: 456 [2022-12-14 12:00:34,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:34,086 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:34,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-12-14 12:00:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 294. [2022-12-14 12:00:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.358361774744027) internal successors, (984), 293 states have internal predecessors, (984), 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-12-14 12:00:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 984 transitions. [2022-12-14 12:00:34,091 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 984 transitions. Word has length 24 [2022-12-14 12:00:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:34,091 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 984 transitions. [2022-12-14 12:00:34,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 984 transitions. [2022-12-14 12:00:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:34,091 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:34,091 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:34,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2022-12-14 12:00:34,092 INFO L420 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash 60292303, now seen corresponding path program 82 times [2022-12-14 12:00:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:34,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405979195] [2022-12-14 12:00:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:34,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:34,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405979195] [2022-12-14 12:00:34,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405979195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:34,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:34,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:34,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495539088] [2022-12-14 12:00:34,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:34,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:34,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:34,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:34,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:34,323 INFO L87 Difference]: Start difference. First operand 294 states and 984 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:34,524 INFO L93 Difference]: Finished difference Result 376 states and 1268 transitions. [2022-12-14 12:00:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:34,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:34,525 INFO L225 Difference]: With dead ends: 376 [2022-12-14 12:00:34,525 INFO L226 Difference]: Without dead ends: 370 [2022-12-14 12:00:34,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:34,525 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:34,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-12-14 12:00:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 294. [2022-12-14 12:00:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3447098976109215) internal successors, (980), 293 states have internal predecessors, (980), 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-12-14 12:00:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 980 transitions. [2022-12-14 12:00:34,529 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 980 transitions. Word has length 24 [2022-12-14 12:00:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:34,529 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 980 transitions. [2022-12-14 12:00:34,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 980 transitions. [2022-12-14 12:00:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:34,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:34,530 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:34,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2022-12-14 12:00:34,530 INFO L420 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:34,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:34,530 INFO L85 PathProgramCache]: Analyzing trace with hash 646573951, now seen corresponding path program 88 times [2022-12-14 12:00:34,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:34,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811661305] [2022-12-14 12:00:34,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:34,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:34,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:34,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811661305] [2022-12-14 12:00:34,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811661305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:34,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:34,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:34,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111625309] [2022-12-14 12:00:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:34,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:34,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:34,776 INFO L87 Difference]: Start difference. First operand 294 states and 980 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:35,081 INFO L93 Difference]: Finished difference Result 408 states and 1352 transitions. [2022-12-14 12:00:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 12:00:35,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:35,082 INFO L225 Difference]: With dead ends: 408 [2022-12-14 12:00:35,082 INFO L226 Difference]: Without dead ends: 404 [2022-12-14 12:00:35,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:35,082 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:35,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-12-14 12:00:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 290. [2022-12-14 12:00:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.339100346020761) internal successors, (965), 289 states have internal predecessors, (965), 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-12-14 12:00:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 965 transitions. [2022-12-14 12:00:35,086 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 965 transitions. Word has length 24 [2022-12-14 12:00:35,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:35,086 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 965 transitions. [2022-12-14 12:00:35,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 965 transitions. [2022-12-14 12:00:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:35,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:35,087 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:35,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2022-12-14 12:00:35,087 INFO L420 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1960497423, now seen corresponding path program 83 times [2022-12-14 12:00:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:35,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179051177] [2022-12-14 12:00:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:35,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:35,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179051177] [2022-12-14 12:00:35,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179051177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:35,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:35,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882752640] [2022-12-14 12:00:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:35,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:35,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:35,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:35,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:35,318 INFO L87 Difference]: Start difference. First operand 290 states and 965 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:35,635 INFO L93 Difference]: Finished difference Result 434 states and 1392 transitions. [2022-12-14 12:00:35,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:35,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:35,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:35,636 INFO L225 Difference]: With dead ends: 434 [2022-12-14 12:00:35,636 INFO L226 Difference]: Without dead ends: 434 [2022-12-14 12:00:35,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:00:35,636 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:35,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-12-14 12:00:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 292. [2022-12-14 12:00:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3402061855670104) internal successors, (972), 291 states have internal predecessors, (972), 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-12-14 12:00:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 972 transitions. [2022-12-14 12:00:35,640 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 972 transitions. Word has length 24 [2022-12-14 12:00:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:35,640 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 972 transitions. [2022-12-14 12:00:35,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 972 transitions. [2022-12-14 12:00:35,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:35,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:35,641 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:35,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2022-12-14 12:00:35,641 INFO L420 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:35,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash 810246353, now seen corresponding path program 84 times [2022-12-14 12:00:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:35,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550074361] [2022-12-14 12:00:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:35,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:35,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550074361] [2022-12-14 12:00:35,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550074361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:35,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:35,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378843185] [2022-12-14 12:00:35,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:35,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:35,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:35,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:35,854 INFO L87 Difference]: Start difference. First operand 292 states and 972 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:35,967 INFO L93 Difference]: Finished difference Result 412 states and 1342 transitions. [2022-12-14 12:00:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:35,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:35,968 INFO L225 Difference]: With dead ends: 412 [2022-12-14 12:00:35,968 INFO L226 Difference]: Without dead ends: 406 [2022-12-14 12:00:35,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:35,968 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:35,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-12-14 12:00:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 290. [2022-12-14 12:00:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.339100346020761) internal successors, (965), 289 states have internal predecessors, (965), 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-12-14 12:00:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 965 transitions. [2022-12-14 12:00:35,975 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 965 transitions. Word has length 24 [2022-12-14 12:00:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:35,975 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 965 transitions. [2022-12-14 12:00:35,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 965 transitions. [2022-12-14 12:00:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:35,975 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:35,975 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:35,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2022-12-14 12:00:35,976 INFO L420 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:35,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash -3020877, now seen corresponding path program 89 times [2022-12-14 12:00:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:35,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047794061] [2022-12-14 12:00:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:36,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:36,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047794061] [2022-12-14 12:00:36,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047794061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:36,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:36,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:36,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909552425] [2022-12-14 12:00:36,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:36,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:36,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:36,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:36,226 INFO L87 Difference]: Start difference. First operand 290 states and 965 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:36,510 INFO L93 Difference]: Finished difference Result 472 states and 1489 transitions. [2022-12-14 12:00:36,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:36,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:36,511 INFO L225 Difference]: With dead ends: 472 [2022-12-14 12:00:36,511 INFO L226 Difference]: Without dead ends: 472 [2022-12-14 12:00:36,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:00:36,512 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:36,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:00:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-12-14 12:00:36,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 292. [2022-12-14 12:00:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3402061855670104) internal successors, (972), 291 states have internal predecessors, (972), 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-12-14 12:00:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 972 transitions. [2022-12-14 12:00:36,516 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 972 transitions. Word has length 24 [2022-12-14 12:00:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:36,516 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 972 transitions. [2022-12-14 12:00:36,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 972 transitions. [2022-12-14 12:00:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:00:36,517 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:36,517 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:36,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2022-12-14 12:00:36,517 INFO L420 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash 516722199, now seen corresponding path program 90 times [2022-12-14 12:00:36,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:36,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352982741] [2022-12-14 12:00:36,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:36,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:36,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352982741] [2022-12-14 12:00:36,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352982741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:36,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:36,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 12:00:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233521321] [2022-12-14 12:00:36,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:36,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:00:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:36,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:00:36,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:00:36,750 INFO L87 Difference]: Start difference. First operand 292 states and 972 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:36,904 INFO L93 Difference]: Finished difference Result 452 states and 1447 transitions. [2022-12-14 12:00:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:00:36,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 12:00:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:36,905 INFO L225 Difference]: With dead ends: 452 [2022-12-14 12:00:36,905 INFO L226 Difference]: Without dead ends: 448 [2022-12-14 12:00:36,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-14 12:00:36,905 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:36,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:00:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-12-14 12:00:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 286. [2022-12-14 12:00:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 3.3017543859649123) internal successors, (941), 285 states have internal predecessors, (941), 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-12-14 12:00:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 941 transitions. [2022-12-14 12:00:36,909 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 941 transitions. Word has length 24 [2022-12-14 12:00:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:36,909 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 941 transitions. [2022-12-14 12:00:36,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 941 transitions. [2022-12-14 12:00:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:00:36,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:36,910 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:36,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2022-12-14 12:00:36,910 INFO L420 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:36,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:36,910 INFO L85 PathProgramCache]: Analyzing trace with hash -107031909, now seen corresponding path program 1 times [2022-12-14 12:00:36,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:36,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43665283] [2022-12-14 12:00:36,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:36,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 12:00:37,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:37,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43665283] [2022-12-14 12:00:37,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43665283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:37,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535123045] [2022-12-14 12:00:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:37,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:37,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:37,107 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:37,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 12:00:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:37,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 12:00:37,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:37,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:37,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-14 12:00:37,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 53 [2022-12-14 12:00:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:37,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:00:38,457 WARN L837 $PredicateComparison]: unable to prove that (or (= c_~name_1~0 c_~name_2~0) (not (= 0 c_~result_4~0)) (and (forall ((v_ArrVal_5083 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5083) c_~nondet_0~0.base) c_~nondet_0~0.offset) c_~name_2~0))) (forall ((v_ArrVal_5083 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5083) c_~nondet_0~0.base) c_~nondet_0~0.offset) c_~name_1~0)))) (= c_~break_7~0 0)) is different from false [2022-12-14 12:00:38,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:00:38,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 84 [2022-12-14 12:00:38,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-12-14 12:00:38,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2022-12-14 12:00:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-12-14 12:00:38,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535123045] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:00:38,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1684471286] [2022-12-14 12:00:38,582 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:00:38,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:00:38,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 26 [2022-12-14 12:00:38,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972395242] [2022-12-14 12:00:38,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:00:38,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 12:00:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:38,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 12:00:38,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=549, Unknown=6, NotChecked=48, Total=702 [2022-12-14 12:00:38,584 INFO L87 Difference]: Start difference. First operand 286 states and 941 transitions. Second operand has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 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-12-14 12:00:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:45,823 INFO L93 Difference]: Finished difference Result 1869 states and 5319 transitions. [2022-12-14 12:00:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-14 12:00:45,824 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 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 25 [2022-12-14 12:00:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:45,826 INFO L225 Difference]: With dead ends: 1869 [2022-12-14 12:00:45,826 INFO L226 Difference]: Without dead ends: 1520 [2022-12-14 12:00:45,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1837, Invalid=7091, Unknown=6, NotChecked=186, Total=9120 [2022-12-14 12:00:45,827 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 489 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3236 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 3236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:45,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 0 Invalid, 3743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 3236 Invalid, 0 Unknown, 428 Unchecked, 2.3s Time] [2022-12-14 12:00:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-12-14 12:00:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 395. [2022-12-14 12:00:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 3.4111675126903553) internal successors, (1344), 394 states have internal predecessors, (1344), 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-12-14 12:00:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1344 transitions. [2022-12-14 12:00:45,837 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1344 transitions. Word has length 25 [2022-12-14 12:00:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:45,837 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 1344 transitions. [2022-12-14 12:00:45,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 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-12-14 12:00:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1344 transitions. [2022-12-14 12:00:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:00:45,838 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:45,838 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:45,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 12:00:46,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable189 [2022-12-14 12:00:46,039 INFO L420 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:46,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:46,040 INFO L85 PathProgramCache]: Analyzing trace with hash 639213530, now seen corresponding path program 1 times [2022-12-14 12:00:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:46,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603166767] [2022-12-14 12:00:46,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:46,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:47,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:47,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603166767] [2022-12-14 12:00:47,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603166767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:47,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680721428] [2022-12-14 12:00:47,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:47,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:47,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:47,222 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:47,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 12:00:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:47,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 12:00:47,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:47,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:47,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-12-14 12:00:47,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 92 [2022-12-14 12:00:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:47,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:00:48,539 WARN L837 $PredicateComparison]: unable to prove that (and (or (< c_~result_8~0 0) (forall ((v_ArrVal_5136 (Array Int Int))) (not (= c_~name_3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5136) c_~nondet_0~0.base) c_~nondet_0~0.offset))))) (or (forall ((v_ArrVal_5136 (Array Int Int))) (= c_~name_3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5136) c_~nondet_0~0.base) c_~nondet_0~0.offset))) (< 0 c_~result_8~0))) is different from false [2022-12-14 12:00:48,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:00:48,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 264 treesize of output 194 [2022-12-14 12:00:48,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 115 [2022-12-14 12:00:48,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 113 [2022-12-14 12:00:48,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 111 [2022-12-14 12:00:48,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 109 [2022-12-14 12:00:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:49,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680721428] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:00:49,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1667551664] [2022-12-14 12:00:49,092 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:00:49,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:00:49,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-12-14 12:00:49,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334910408] [2022-12-14 12:00:49,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:00:49,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 12:00:49,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:49,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 12:00:49,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=766, Unknown=8, NotChecked=56, Total=930 [2022-12-14 12:00:49,094 INFO L87 Difference]: Start difference. First operand 395 states and 1344 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 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-12-14 12:00:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:59,236 INFO L93 Difference]: Finished difference Result 1065 states and 3050 transitions. [2022-12-14 12:00:59,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-14 12:00:59,237 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 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 25 [2022-12-14 12:00:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:59,238 INFO L225 Difference]: With dead ends: 1065 [2022-12-14 12:00:59,238 INFO L226 Difference]: Without dead ends: 1036 [2022-12-14 12:00:59,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 5 DeprecatedPredicates, 1852 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1644, Invalid=5834, Unknown=8, NotChecked=170, Total=7656 [2022-12-14 12:00:59,239 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 519 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3026 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:59,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 0 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3026 Invalid, 0 Unknown, 268 Unchecked, 1.9s Time] [2022-12-14 12:00:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-12-14 12:00:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 493. [2022-12-14 12:00:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 3.3495934959349594) internal successors, (1648), 492 states have internal predecessors, (1648), 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-12-14 12:00:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1648 transitions. [2022-12-14 12:00:59,248 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1648 transitions. Word has length 25 [2022-12-14 12:00:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:59,248 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 1648 transitions. [2022-12-14 12:00:59,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 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-12-14 12:00:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1648 transitions. [2022-12-14 12:00:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:00:59,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:59,249 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:59,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 12:00:59,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:59,451 INFO L420 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:00:59,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash 482707164, now seen corresponding path program 2 times [2022-12-14 12:00:59,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:59,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863402927] [2022-12-14 12:00:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:01:00,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:01:00,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863402927] [2022-12-14 12:01:00,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863402927] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:01:00,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751123335] [2022-12-14 12:01:00,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:01:00,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:00,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:01:00,680 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:01:00,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 12:01:00,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:01:00,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:01:00,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 12:01:00,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:01:01,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 113 [2022-12-14 12:01:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:01,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:03,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:01:03,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 451 treesize of output 319 [2022-12-14 12:01:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:04,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751123335] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:04,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [921172596] [2022-12-14 12:01:04,201 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:01:04,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:04,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2022-12-14 12:01:04,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677019002] [2022-12-14 12:01:04,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:01:04,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:01:04,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:04,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:01:04,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 12:01:04,202 INFO L87 Difference]: Start difference. First operand 493 states and 1648 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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-12-14 12:01:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:01:06,521 INFO L93 Difference]: Finished difference Result 679 states and 2089 transitions. [2022-12-14 12:01:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 12:01:06,522 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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 25 [2022-12-14 12:01:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:01:06,523 INFO L225 Difference]: With dead ends: 679 [2022-12-14 12:01:06,523 INFO L226 Difference]: Without dead ends: 665 [2022-12-14 12:01:06,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=384, Invalid=1778, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 12:01:06,523 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 288 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 12:01:06,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 0 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 12:01:06,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-12-14 12:01:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 519. [2022-12-14 12:01:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 3.362934362934363) internal successors, (1742), 518 states have internal predecessors, (1742), 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-12-14 12:01:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1742 transitions. [2022-12-14 12:01:06,530 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1742 transitions. Word has length 25 [2022-12-14 12:01:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:01:06,530 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 1742 transitions. [2022-12-14 12:01:06,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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-12-14 12:01:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1742 transitions. [2022-12-14 12:01:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:01:06,531 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:01:06,531 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:01:06,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 12:01:06,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:06,732 INFO L420 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:01:06,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:01:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2101646824, now seen corresponding path program 3 times [2022-12-14 12:01:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:01:06,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140515368] [2022-12-14 12:01:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:01:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:07,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:01:07,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140515368] [2022-12-14 12:01:07,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140515368] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:01:07,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720948141] [2022-12-14 12:01:07,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:01:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:01:07,518 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:01:07,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 12:01:07,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:01:07,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:01:07,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 12:01:07,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:01:07,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 139 [2022-12-14 12:01:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:08,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:09,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:01:09,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 305 [2022-12-14 12:01:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:10,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720948141] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:10,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [782163196] [2022-12-14 12:01:10,693 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:01:10,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:10,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2022-12-14 12:01:10,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17584363] [2022-12-14 12:01:10,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:01:10,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 12:01:10,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:10,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 12:01:10,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2022-12-14 12:01:10,694 INFO L87 Difference]: Start difference. First operand 519 states and 1742 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 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-12-14 12:01:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:01:13,626 INFO L93 Difference]: Finished difference Result 708 states and 2180 transitions. [2022-12-14 12:01:13,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 12:01:13,626 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 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 25 [2022-12-14 12:01:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:01:13,627 INFO L225 Difference]: With dead ends: 708 [2022-12-14 12:01:13,627 INFO L226 Difference]: Without dead ends: 677 [2022-12-14 12:01:13,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=340, Invalid=1300, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 12:01:13,628 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 247 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 12:01:13,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 0 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 12:01:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-12-14 12:01:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 539. [2022-12-14 12:01:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 3.362453531598513) internal successors, (1809), 538 states have internal predecessors, (1809), 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-12-14 12:01:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1809 transitions. [2022-12-14 12:01:13,635 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1809 transitions. Word has length 25 [2022-12-14 12:01:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:01:13,635 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 1809 transitions. [2022-12-14 12:01:13,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 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-12-14 12:01:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1809 transitions. [2022-12-14 12:01:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:01:13,636 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:01:13,636 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:01:13,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 12:01:13,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:13,837 INFO L420 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:01:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:01:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1805675522, now seen corresponding path program 4 times [2022-12-14 12:01:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:01:13,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165514452] [2022-12-14 12:01:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:01:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:14,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:01:14,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165514452] [2022-12-14 12:01:14,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165514452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:01:14,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278726703] [2022-12-14 12:01:14,600 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:01:14,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:14,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:01:14,601 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:01:14,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 12:01:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:14,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 12:01:14,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:01:15,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 112 [2022-12-14 12:01:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:15,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:16,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:01:16,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 158 [2022-12-14 12:01:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:16,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278726703] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:16,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [255138327] [2022-12-14 12:01:16,601 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:01:16,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:16,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-12-14 12:01:16,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784310975] [2022-12-14 12:01:16,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:01:16,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 12:01:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:16,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 12:01:16,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2022-12-14 12:01:16,603 INFO L87 Difference]: Start difference. First operand 539 states and 1809 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 states have internal predecessors, (65), 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-12-14 12:01:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:01:20,090 INFO L93 Difference]: Finished difference Result 790 states and 2410 transitions. [2022-12-14 12:01:20,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 12:01:20,091 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 states have internal predecessors, (65), 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 25 [2022-12-14 12:01:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:01:20,092 INFO L225 Difference]: With dead ends: 790 [2022-12-14 12:01:20,092 INFO L226 Difference]: Without dead ends: 757 [2022-12-14 12:01:20,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=462, Invalid=1608, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 12:01:20,092 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 261 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 12:01:20,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 0 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 12:01:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-12-14 12:01:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 559. [2022-12-14 12:01:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 3.347670250896057) internal successors, (1868), 558 states have internal predecessors, (1868), 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-12-14 12:01:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1868 transitions. [2022-12-14 12:01:20,100 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1868 transitions. Word has length 25 [2022-12-14 12:01:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:01:20,100 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 1868 transitions. [2022-12-14 12:01:20,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 states have internal predecessors, (65), 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-12-14 12:01:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1868 transitions. [2022-12-14 12:01:20,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:01:20,101 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:01:20,101 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:01:20,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 12:01:20,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable193 [2022-12-14 12:01:20,302 INFO L420 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:01:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:01:20,303 INFO L85 PathProgramCache]: Analyzing trace with hash -934009062, now seen corresponding path program 5 times [2022-12-14 12:01:20,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:01:20,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453932837] [2022-12-14 12:01:20,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:01:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:21,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:01:21,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453932837] [2022-12-14 12:01:21,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453932837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:01:21,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064013035] [2022-12-14 12:01:21,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:01:21,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:21,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:01:21,160 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:01:21,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 12:01:21,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:01:21,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:01:21,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 12:01:21,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:01:21,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 126 [2022-12-14 12:01:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:21,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:23,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:01:23,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 388 treesize of output 280 [2022-12-14 12:01:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:24,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064013035] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:24,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732798541] [2022-12-14 12:01:24,359 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:01:24,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:24,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2022-12-14 12:01:24,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064787604] [2022-12-14 12:01:24,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:01:24,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 12:01:24,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:24,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 12:01:24,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-12-14 12:01:24,360 INFO L87 Difference]: Start difference. First operand 559 states and 1868 transitions. Second operand has 25 states, 24 states have (on average 2.75) internal successors, (66), 25 states have internal predecessors, (66), 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-12-14 12:01:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:01:29,497 INFO L93 Difference]: Finished difference Result 1062 states and 3272 transitions. [2022-12-14 12:01:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 12:01:29,497 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 25 states have internal predecessors, (66), 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 25 [2022-12-14 12:01:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:01:29,499 INFO L225 Difference]: With dead ends: 1062 [2022-12-14 12:01:29,499 INFO L226 Difference]: Without dead ends: 1047 [2022-12-14 12:01:29,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=849, Invalid=3183, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 12:01:29,499 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 439 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 12:01:29,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 0 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 12:01:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-12-14 12:01:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 595. [2022-12-14 12:01:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 3.4696969696969697) internal successors, (2061), 594 states have internal predecessors, (2061), 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-12-14 12:01:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 2061 transitions. [2022-12-14 12:01:29,509 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 2061 transitions. Word has length 25 [2022-12-14 12:01:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:01:29,509 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 2061 transitions. [2022-12-14 12:01:29,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 25 states have internal predecessors, (66), 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-12-14 12:01:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 2061 transitions. [2022-12-14 12:01:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:01:29,510 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:01:29,510 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:01:29,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 12:01:29,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable194 [2022-12-14 12:01:29,712 INFO L420 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:01:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:01:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash -460332162, now seen corresponding path program 6 times [2022-12-14 12:01:29,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:01:29,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654441825] [2022-12-14 12:01:29,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:01:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:30,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:01:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654441825] [2022-12-14 12:01:30,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654441825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:01:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419130857] [2022-12-14 12:01:30,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:01:30,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:30,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:01:30,387 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:01:30,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 12:01:30,606 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:01:30,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:01:30,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 12:01:30,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:01:30,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 139 [2022-12-14 12:01:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:31,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:33,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:01:33,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 406 treesize of output 306 [2022-12-14 12:01:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:34,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419130857] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:34,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533528311] [2022-12-14 12:01:34,067 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:01:34,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:34,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 21 [2022-12-14 12:01:34,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734944531] [2022-12-14 12:01:34,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:01:34,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 12:01:34,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:34,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 12:01:34,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-12-14 12:01:34,068 INFO L87 Difference]: Start difference. First operand 595 states and 2061 transitions. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 22 states have internal predecessors, (54), 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-12-14 12:01:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:01:40,764 INFO L93 Difference]: Finished difference Result 1447 states and 4028 transitions. [2022-12-14 12:01:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-14 12:01:40,765 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 22 states have internal predecessors, (54), 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 25 [2022-12-14 12:01:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:01:40,767 INFO L225 Difference]: With dead ends: 1447 [2022-12-14 12:01:40,767 INFO L226 Difference]: Without dead ends: 1385 [2022-12-14 12:01:40,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=792, Invalid=3240, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 12:01:40,767 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 456 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 12:01:40,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 0 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2044 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 12:01:40,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2022-12-14 12:01:40,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 599. [2022-12-14 12:01:40,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 3.451505016722408) internal successors, (2064), 598 states have internal predecessors, (2064), 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-12-14 12:01:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 2064 transitions. [2022-12-14 12:01:40,779 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 2064 transitions. Word has length 25 [2022-12-14 12:01:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:01:40,779 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 2064 transitions. [2022-12-14 12:01:40,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 22 states have internal predecessors, (54), 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-12-14 12:01:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 2064 transitions. [2022-12-14 12:01:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:01:40,780 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:01:40,780 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:01:40,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 12:01:40,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:40,982 INFO L420 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:01:40,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:01:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1294776898, now seen corresponding path program 7 times [2022-12-14 12:01:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:01:40,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782650449] [2022-12-14 12:01:40,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:01:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:41,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:01:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782650449] [2022-12-14 12:01:41,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782650449] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:01:41,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273284053] [2022-12-14 12:01:41,696 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:01:41,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:01:41,696 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:01:41,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 12:01:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:41,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 12:01:41,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:01:42,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 79 [2022-12-14 12:01:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:42,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:43,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:01:43,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 484 treesize of output 304 [2022-12-14 12:01:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:44,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273284053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:44,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [680875310] [2022-12-14 12:01:44,303 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:01:44,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:44,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2022-12-14 12:01:44,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550322865] [2022-12-14 12:01:44,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:01:44,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 12:01:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:44,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 12:01:44,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-12-14 12:01:44,304 INFO L87 Difference]: Start difference. First operand 599 states and 2064 transitions. Second operand has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 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-12-14 12:01:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:01:46,523 INFO L93 Difference]: Finished difference Result 1000 states and 3169 transitions. [2022-12-14 12:01:46,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 12:01:46,523 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 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 25 [2022-12-14 12:01:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:01:46,525 INFO L225 Difference]: With dead ends: 1000 [2022-12-14 12:01:46,525 INFO L226 Difference]: Without dead ends: 985 [2022-12-14 12:01:46,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 12:01:46,525 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 286 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 12:01:46,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 0 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 12:01:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2022-12-14 12:01:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 595. [2022-12-14 12:01:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 3.4494949494949494) internal successors, (2049), 594 states have internal predecessors, (2049), 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-12-14 12:01:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 2049 transitions. [2022-12-14 12:01:46,534 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 2049 transitions. Word has length 25 [2022-12-14 12:01:46,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:01:46,534 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 2049 transitions. [2022-12-14 12:01:46,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 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-12-14 12:01:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 2049 transitions. [2022-12-14 12:01:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:01:46,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:01:46,535 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:01:46,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 12:01:46,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:46,737 INFO L420 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:01:46,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:01:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash 776604246, now seen corresponding path program 8 times [2022-12-14 12:01:46,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:01:46,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945749962] [2022-12-14 12:01:46,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:46,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:01:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:47,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:01:47,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945749962] [2022-12-14 12:01:47,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945749962] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:01:47,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976084557] [2022-12-14 12:01:47,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:01:47,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:47,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:01:47,891 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:01:47,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 12:01:48,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 12:01:48,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:01:48,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 12:01:48,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:01:48,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 126 [2022-12-14 12:01:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:48,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:49,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:01:49,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 246 [2022-12-14 12:01:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:50,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976084557] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:50,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1557096694] [2022-12-14 12:01:50,711 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:01:50,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:50,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2022-12-14 12:01:50,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209604848] [2022-12-14 12:01:50,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:01:50,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 12:01:50,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:50,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 12:01:50,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-12-14 12:01:50,712 INFO L87 Difference]: Start difference. First operand 595 states and 2049 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 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-12-14 12:01:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:01:52,866 INFO L93 Difference]: Finished difference Result 804 states and 2538 transitions. [2022-12-14 12:01:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 12:01:52,867 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 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 25 [2022-12-14 12:01:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:01:52,868 INFO L225 Difference]: With dead ends: 804 [2022-12-14 12:01:52,868 INFO L226 Difference]: Without dead ends: 783 [2022-12-14 12:01:52,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=329, Invalid=1231, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 12:01:52,868 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 255 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 12:01:52,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 0 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 12:01:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-12-14 12:01:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 607. [2022-12-14 12:01:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 606 states have (on average 3.4554455445544554) internal successors, (2094), 606 states have internal predecessors, (2094), 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-12-14 12:01:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 2094 transitions. [2022-12-14 12:01:52,876 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 2094 transitions. Word has length 25 [2022-12-14 12:01:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:01:52,876 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 2094 transitions. [2022-12-14 12:01:52,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 26 states have internal predecessors, (55), 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-12-14 12:01:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 2094 transitions. [2022-12-14 12:01:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:01:52,877 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:01:52,877 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:01:52,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 12:01:53,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:53,079 INFO L420 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:01:53,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:01:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1341906890, now seen corresponding path program 9 times [2022-12-14 12:01:53,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:01:53,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157996667] [2022-12-14 12:01:53,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:53,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:01:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:01:54,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:01:54,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157996667] [2022-12-14 12:01:54,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157996667] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:01:54,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564169916] [2022-12-14 12:01:54,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:01:54,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:54,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:01:54,308 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:01:54,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 12:01:54,575 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:01:54,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:01:54,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-14 12:01:54,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:01:54,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:54,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2022-12-14 12:01:55,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 126 [2022-12-14 12:01:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:55,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:59,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:01:59,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 248 [2022-12-14 12:01:59,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 155 [2022-12-14 12:01:59,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 153 [2022-12-14 12:01:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:01:59,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564169916] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:59,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1056624890] [2022-12-14 12:01:59,927 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:01:59,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:59,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 36 [2022-12-14 12:01:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222547269] [2022-12-14 12:01:59,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:01:59,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 12:01:59,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:59,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 12:01:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1255, Unknown=2, NotChecked=0, Total=1406 [2022-12-14 12:01:59,928 INFO L87 Difference]: Start difference. First operand 607 states and 2094 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 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-12-14 12:02:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:02:56,073 INFO L93 Difference]: Finished difference Result 2274 states and 6632 transitions. [2022-12-14 12:02:56,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-12-14 12:02:56,073 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 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 25 [2022-12-14 12:02:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:02:56,077 INFO L225 Difference]: With dead ends: 2274 [2022-12-14 12:02:56,077 INFO L226 Difference]: Without dead ends: 2196 [2022-12-14 12:02:56,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5218 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=4056, Invalid=15124, Unknown=2, NotChecked=0, Total=19182 [2022-12-14 12:02:56,078 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 804 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4334 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 4334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:02:56,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 0 Invalid, 4430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 4334 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-12-14 12:02:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2022-12-14 12:02:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 660. [2022-12-14 12:02:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 3.60546282245827) internal successors, (2376), 659 states have internal predecessors, (2376), 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-12-14 12:02:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 2376 transitions. [2022-12-14 12:02:56,095 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 2376 transitions. Word has length 25 [2022-12-14 12:02:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:02:56,095 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 2376 transitions. [2022-12-14 12:02:56,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 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-12-14 12:02:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 2376 transitions. [2022-12-14 12:02:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:02:56,096 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:02:56,096 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:02:56,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 12:02:56,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:02:56,297 INFO L420 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:02:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:02:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1618698558, now seen corresponding path program 10 times [2022-12-14 12:02:56,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:02:56,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705941829] [2022-12-14 12:02:56,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:02:56,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:02:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:02:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:02:57,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:02:57,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705941829] [2022-12-14 12:02:57,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705941829] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:02:57,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549833221] [2022-12-14 12:02:57,419 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:02:57,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:02:57,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:02:57,420 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:02:57,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 12:02:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:02:57,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 12:02:57,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:02:57,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:02:57,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-12-14 12:02:58,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 128 [2022-12-14 12:02:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:02:58,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:03:01,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:03:01,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 193 [2022-12-14 12:03:01,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 138 [2022-12-14 12:03:01,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 136 [2022-12-14 12:03:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:03:02,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549833221] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:03:02,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1882350057] [2022-12-14 12:03:02,518 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:03:02,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:03:02,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 12:03:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138789284] [2022-12-14 12:03:02,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:03:02,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 12:03:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:03:02,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 12:03:02,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1076, Unknown=1, NotChecked=0, Total=1190 [2022-12-14 12:03:02,519 INFO L87 Difference]: Start difference. First operand 660 states and 2376 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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-12-14 12:03:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:03:13,965 INFO L93 Difference]: Finished difference Result 1210 states and 3828 transitions. [2022-12-14 12:03:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 12:03:13,965 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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 25 [2022-12-14 12:03:13,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:03:13,967 INFO L225 Difference]: With dead ends: 1210 [2022-12-14 12:03:13,967 INFO L226 Difference]: Without dead ends: 1196 [2022-12-14 12:03:13,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=991, Invalid=3430, Unknown=1, NotChecked=0, Total=4422 [2022-12-14 12:03:13,967 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 519 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 12:03:13,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 0 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 12:03:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-12-14 12:03:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 670. [2022-12-14 12:03:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 3.6278026905829597) internal successors, (2427), 669 states have internal predecessors, (2427), 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-12-14 12:03:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 2427 transitions. [2022-12-14 12:03:13,979 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 2427 transitions. Word has length 25 [2022-12-14 12:03:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:03:13,979 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 2427 transitions. [2022-12-14 12:03:13,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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-12-14 12:03:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 2427 transitions. [2022-12-14 12:03:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:03:13,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:03:13,980 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:03:13,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 12:03:14,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable199 [2022-12-14 12:03:14,182 INFO L420 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:03:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:03:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1301928858, now seen corresponding path program 11 times [2022-12-14 12:03:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:03:14,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745522073] [2022-12-14 12:03:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:03:14,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:03:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:03:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:03:15,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:03:15,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745522073] [2022-12-14 12:03:15,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745522073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:03:15,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306808542] [2022-12-14 12:03:15,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:03:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:03:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:03:15,276 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:03:15,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 12:03:15,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 12:03:15,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:03:15,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-14 12:03:15,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:03:15,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:03:15,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2022-12-14 12:03:16,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 118 [2022-12-14 12:03:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:03:16,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:03:20,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:03:20,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 384 treesize of output 318 [2022-12-14 12:03:20,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 239 [2022-12-14 12:03:20,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 237 [2022-12-14 12:03:20,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 235 [2022-12-14 12:03:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:03:21,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306808542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:03:21,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1264632049] [2022-12-14 12:03:21,635 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:03:21,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:03:21,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-12-14 12:03:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176596376] [2022-12-14 12:03:21,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:03:21,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:03:21,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:03:21,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:03:21,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1002, Unknown=6, NotChecked=0, Total=1122 [2022-12-14 12:03:21,636 INFO L87 Difference]: Start difference. First operand 670 states and 2427 transitions. Second operand has 34 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 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-12-14 12:03:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:03:41,712 INFO L93 Difference]: Finished difference Result 1455 states and 4421 transitions. [2022-12-14 12:03:41,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-14 12:03:41,713 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 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 25 [2022-12-14 12:03:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:03:41,715 INFO L225 Difference]: With dead ends: 1455 [2022-12-14 12:03:41,715 INFO L226 Difference]: Without dead ends: 1391 [2022-12-14 12:03:41,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=1436, Invalid=6040, Unknown=6, NotChecked=0, Total=7482 [2022-12-14 12:03:41,716 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 496 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 12:03:41,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 0 Invalid, 3386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-12-14 12:03:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2022-12-14 12:03:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 690. [2022-12-14 12:03:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 3.641509433962264) internal successors, (2509), 689 states have internal predecessors, (2509), 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-12-14 12:03:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 2509 transitions. [2022-12-14 12:03:41,731 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 2509 transitions. Word has length 25 [2022-12-14 12:03:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:03:41,731 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 2509 transitions. [2022-12-14 12:03:41,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 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-12-14 12:03:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 2509 transitions. [2022-12-14 12:03:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:03:41,732 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:03:41,732 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:03:41,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 12:03:41,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:03:41,933 INFO L420 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:03:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:03:41,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2066557388, now seen corresponding path program 12 times [2022-12-14 12:03:41,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:03:41,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294232858] [2022-12-14 12:03:41,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:03:41,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:03:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:03:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:03:42,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:03:42,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294232858] [2022-12-14 12:03:42,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294232858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:03:42,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983710504] [2022-12-14 12:03:42,765 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:03:42,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:03:42,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:03:42,766 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:03:42,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 12:03:42,993 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:03:42,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:03:42,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 12:03:42,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:03:43,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 126 [2022-12-14 12:03:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:03:43,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:03:45,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:03:45,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 385 treesize of output 269 [2022-12-14 12:03:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:03:45,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983710504] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:03:45,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [722556623] [2022-12-14 12:03:45,513 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:03:45,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:03:45,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2022-12-14 12:03:45,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485088717] [2022-12-14 12:03:45,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:03:45,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 12:03:45,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:03:45,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 12:03:45,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2022-12-14 12:03:45,514 INFO L87 Difference]: Start difference. First operand 690 states and 2509 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-12-14 12:03:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:03:58,211 INFO L93 Difference]: Finished difference Result 1443 states and 4469 transitions. [2022-12-14 12:03:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-14 12:03:58,211 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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 25 [2022-12-14 12:03:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:03:58,213 INFO L225 Difference]: With dead ends: 1443 [2022-12-14 12:03:58,213 INFO L226 Difference]: Without dead ends: 1400 [2022-12-14 12:03:58,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2300 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1512, Invalid=7044, Unknown=0, NotChecked=0, Total=8556 [2022-12-14 12:03:58,214 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 512 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:03:58,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 0 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 12:03:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2022-12-14 12:03:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 734. [2022-12-14 12:03:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 3.7216916780354707) internal successors, (2728), 733 states have internal predecessors, (2728), 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-12-14 12:03:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 2728 transitions. [2022-12-14 12:03:58,227 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 2728 transitions. Word has length 25 [2022-12-14 12:03:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:03:58,227 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 2728 transitions. [2022-12-14 12:03:58,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-12-14 12:03:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 2728 transitions. [2022-12-14 12:03:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:03:58,228 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:03:58,228 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:03:58,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-14 12:03:58,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable201 [2022-12-14 12:03:58,430 INFO L420 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:03:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:03:58,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1867642072, now seen corresponding path program 13 times [2022-12-14 12:03:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:03:58,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095290973] [2022-12-14 12:03:58,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:03:58,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:03:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:03:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:03:59,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:03:59,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095290973] [2022-12-14 12:03:59,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095290973] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:03:59,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702177428] [2022-12-14 12:03:59,151 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:03:59,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:03:59,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:03:59,152 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:03:59,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 12:03:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:03:59,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 12:03:59,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:03:59,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 105 [2022-12-14 12:03:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:03:59,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:04:00,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:04:00,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 246 [2022-12-14 12:04:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:01,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702177428] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:04:01,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1940880044] [2022-12-14 12:04:01,580 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:04:01,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:04:01,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2022-12-14 12:04:01,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788513122] [2022-12-14 12:04:01,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:04:01,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 12:04:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:04:01,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 12:04:01,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-12-14 12:04:01,581 INFO L87 Difference]: Start difference. First operand 734 states and 2728 transitions. Second operand has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 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-12-14 12:04:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:04:04,153 INFO L93 Difference]: Finished difference Result 1073 states and 3597 transitions. [2022-12-14 12:04:04,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 12:04:04,154 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 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 25 [2022-12-14 12:04:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:04:04,155 INFO L225 Difference]: With dead ends: 1073 [2022-12-14 12:04:04,156 INFO L226 Difference]: Without dead ends: 1058 [2022-12-14 12:04:04,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 12:04:04,156 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 12:04:04,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 12:04:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-12-14 12:04:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 710. [2022-12-14 12:04:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 3.681241184767278) internal successors, (2610), 709 states have internal predecessors, (2610), 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-12-14 12:04:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 2610 transitions. [2022-12-14 12:04:04,167 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 2610 transitions. Word has length 25 [2022-12-14 12:04:04,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:04:04,167 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 2610 transitions. [2022-12-14 12:04:04,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 21 states have internal predecessors, (55), 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-12-14 12:04:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 2610 transitions. [2022-12-14 12:04:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:04:04,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:04:04,168 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:04:04,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-14 12:04:04,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable202 [2022-12-14 12:04:04,369 INFO L420 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:04:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:04:04,370 INFO L85 PathProgramCache]: Analyzing trace with hash -355944080, now seen corresponding path program 14 times [2022-12-14 12:04:04,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:04:04,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901421428] [2022-12-14 12:04:04,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:04:04,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:04:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:04:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:04:05,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:04:05,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901421428] [2022-12-14 12:04:05,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901421428] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:04:05,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075817801] [2022-12-14 12:04:05,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:04:05,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:04:05,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:04:05,943 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:04:05,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 12:04:06,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 12:04:06,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:04:06,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 12:04:06,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:04:06,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 89 [2022-12-14 12:04:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:06,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:04:08,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:04:08,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 507 treesize of output 383 [2022-12-14 12:04:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:09,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075817801] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:04:09,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1959801253] [2022-12-14 12:04:09,658 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:04:09,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:04:09,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 34 [2022-12-14 12:04:09,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854290170] [2022-12-14 12:04:09,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:04:09,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 12:04:09,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:04:09,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 12:04:09,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 12:04:09,659 INFO L87 Difference]: Start difference. First operand 710 states and 2610 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 35 states have internal predecessors, (71), 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-12-14 12:04:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:04:17,579 INFO L93 Difference]: Finished difference Result 2315 states and 7322 transitions. [2022-12-14 12:04:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-12-14 12:04:17,579 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 35 states have internal predecessors, (71), 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 25 [2022-12-14 12:04:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:04:17,583 INFO L225 Difference]: With dead ends: 2315 [2022-12-14 12:04:17,583 INFO L226 Difference]: Without dead ends: 2301 [2022-12-14 12:04:17,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2771 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1535, Invalid=8565, Unknown=0, NotChecked=0, Total=10100 [2022-12-14 12:04:17,583 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 831 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 12:04:17,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 0 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 12:04:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2022-12-14 12:04:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 724. [2022-12-14 12:04:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 3.6666666666666665) internal successors, (2651), 723 states have internal predecessors, (2651), 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-12-14 12:04:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 2651 transitions. [2022-12-14 12:04:17,602 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 2651 transitions. Word has length 25 [2022-12-14 12:04:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:04:17,602 INFO L495 AbstractCegarLoop]: Abstraction has 724 states and 2651 transitions. [2022-12-14 12:04:17,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 35 states have internal predecessors, (71), 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-12-14 12:04:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 2651 transitions. [2022-12-14 12:04:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:04:17,603 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:04:17,603 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:04:17,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 12:04:17,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable203 [2022-12-14 12:04:17,804 INFO L420 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:04:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:04:17,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1602989470, now seen corresponding path program 15 times [2022-12-14 12:04:17,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:04:17,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202450381] [2022-12-14 12:04:17,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:04:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:04:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:04:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:18,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:04:18,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202450381] [2022-12-14 12:04:18,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202450381] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:04:18,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002517935] [2022-12-14 12:04:18,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:04:18,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:04:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:04:18,559 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:04:18,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 12:04:18,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:04:18,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:04:18,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 12:04:18,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:04:19,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 79 [2022-12-14 12:04:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:19,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:04:20,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:04:20,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 246 [2022-12-14 12:04:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:21,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002517935] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:04:21,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [163972345] [2022-12-14 12:04:21,163 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:04:21,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:04:21,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 22 [2022-12-14 12:04:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380328984] [2022-12-14 12:04:21,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:04:21,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 12:04:21,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:04:21,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 12:04:21,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-12-14 12:04:21,164 INFO L87 Difference]: Start difference. First operand 724 states and 2651 transitions. Second operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 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-12-14 12:04:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:04:28,951 INFO L93 Difference]: Finished difference Result 1483 states and 4678 transitions. [2022-12-14 12:04:28,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-14 12:04:28,952 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 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 25 [2022-12-14 12:04:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:04:28,954 INFO L225 Difference]: With dead ends: 1483 [2022-12-14 12:04:28,954 INFO L226 Difference]: Without dead ends: 1454 [2022-12-14 12:04:28,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1087, Invalid=4463, Unknown=0, NotChecked=0, Total=5550 [2022-12-14 12:04:28,954 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 473 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 12:04:28,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 0 Invalid, 2659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2621 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 12:04:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-12-14 12:04:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 768. [2022-12-14 12:04:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 3.7196870925684484) internal successors, (2853), 767 states have internal predecessors, (2853), 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-12-14 12:04:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 2853 transitions. [2022-12-14 12:04:28,969 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 2853 transitions. Word has length 25 [2022-12-14 12:04:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:04:28,969 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 2853 transitions. [2022-12-14 12:04:28,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 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-12-14 12:04:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 2853 transitions. [2022-12-14 12:04:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:04:28,970 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:04:28,970 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:04:28,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-14 12:04:29,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable204 [2022-12-14 12:04:29,172 INFO L420 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:04:29,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:04:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1353433968, now seen corresponding path program 16 times [2022-12-14 12:04:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:04:29,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439383416] [2022-12-14 12:04:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:04:29,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:04:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:04:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:29,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:04:29,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439383416] [2022-12-14 12:04:29,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439383416] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:04:29,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946845267] [2022-12-14 12:04:29,998 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:04:29,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:04:29,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:04:29,998 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:04:29,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 12:04:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:04:30,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 12:04:30,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:04:30,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 126 [2022-12-14 12:04:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:30,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:04:33,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:04:33,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 508 treesize of output 408 [2022-12-14 12:04:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:36,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946845267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:04:36,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1902134383] [2022-12-14 12:04:36,315 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:04:36,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:04:36,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 28 [2022-12-14 12:04:36,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460499931] [2022-12-14 12:04:36,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:04:36,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 12:04:36,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:04:36,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 12:04:36,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2022-12-14 12:04:36,322 INFO L87 Difference]: Start difference. First operand 768 states and 2853 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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-12-14 12:04:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:04:52,068 INFO L93 Difference]: Finished difference Result 1878 states and 5649 transitions. [2022-12-14 12:04:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-14 12:04:52,068 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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 25 [2022-12-14 12:04:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:04:52,071 INFO L225 Difference]: With dead ends: 1878 [2022-12-14 12:04:52,071 INFO L226 Difference]: Without dead ends: 1847 [2022-12-14 12:04:52,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=1439, Invalid=5203, Unknown=0, NotChecked=0, Total=6642 [2022-12-14 12:04:52,071 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 517 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:04:52,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 0 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 12:04:52,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2022-12-14 12:04:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 790. [2022-12-14 12:04:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 3.76425855513308) internal successors, (2970), 789 states have internal predecessors, (2970), 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-12-14 12:04:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 2970 transitions. [2022-12-14 12:04:52,087 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 2970 transitions. Word has length 25 [2022-12-14 12:04:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:04:52,087 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 2970 transitions. [2022-12-14 12:04:52,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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-12-14 12:04:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 2970 transitions. [2022-12-14 12:04:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:04:52,088 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:04:52,089 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:04:52,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 12:04:52,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable205 [2022-12-14 12:04:52,290 INFO L420 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:04:52,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:04:52,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1157465194, now seen corresponding path program 17 times [2022-12-14 12:04:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:04:52,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108283551] [2022-12-14 12:04:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:04:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:04:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:04:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:53,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:04:53,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108283551] [2022-12-14 12:04:53,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108283551] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:04:53,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603994988] [2022-12-14 12:04:53,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:04:53,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:04:53,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:04:53,144 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:04:53,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 12:04:53,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 12:04:53,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:04:53,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 12:04:53,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:04:53,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 142 [2022-12-14 12:04:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:54,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:04:57,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:04:57,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 638 treesize of output 506 [2022-12-14 12:04:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:04:59,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603994988] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:04:59,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1993146540] [2022-12-14 12:04:59,191 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:04:59,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:04:59,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2022-12-14 12:04:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823534292] [2022-12-14 12:04:59,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:04:59,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 12:04:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:04:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 12:04:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2022-12-14 12:04:59,192 INFO L87 Difference]: Start difference. First operand 790 states and 2970 transitions. Second operand has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 27 states have internal predecessors, (59), 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-12-14 12:05:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:05:06,412 INFO L93 Difference]: Finished difference Result 1286 states and 4215 transitions. [2022-12-14 12:05:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 12:05:06,413 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 27 states have internal predecessors, (59), 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 25 [2022-12-14 12:05:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:05:06,415 INFO L225 Difference]: With dead ends: 1286 [2022-12-14 12:05:06,415 INFO L226 Difference]: Without dead ends: 1265 [2022-12-14 12:05:06,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=716, Invalid=2476, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 12:05:06,415 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 309 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 12:05:06,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 0 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 12:05:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2022-12-14 12:05:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 798. [2022-12-14 12:05:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 3.7867001254705146) internal successors, (3018), 797 states have internal predecessors, (3018), 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-12-14 12:05:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3018 transitions. [2022-12-14 12:05:06,429 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3018 transitions. Word has length 25 [2022-12-14 12:05:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:05:06,429 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 3018 transitions. [2022-12-14 12:05:06,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 27 states have internal predecessors, (59), 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-12-14 12:05:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3018 transitions. [2022-12-14 12:05:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:05:06,430 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:05:06,431 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:05:06,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 12:05:06,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable206 [2022-12-14 12:05:06,632 INFO L420 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:05:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:05:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash -67486606, now seen corresponding path program 18 times [2022-12-14 12:05:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:05:06,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873572938] [2022-12-14 12:05:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:05:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:05:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:05:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:05:07,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:05:07,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873572938] [2022-12-14 12:05:07,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873572938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:05:07,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311251136] [2022-12-14 12:05:07,540 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:05:07,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:05:07,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:05:07,541 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:05:07,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 12:05:07,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:05:07,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:05:07,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 12:05:07,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:05:08,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 110 [2022-12-14 12:05:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:05:08,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:05:10,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:05:10,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 443 treesize of output 359 [2022-12-14 12:05:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:05:11,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311251136] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:05:11,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [605167601] [2022-12-14 12:05:11,328 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:05:11,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:05:11,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 28 [2022-12-14 12:05:11,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536020164] [2022-12-14 12:05:11,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:05:11,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 12:05:11,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:05:11,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 12:05:11,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2022-12-14 12:05:11,330 INFO L87 Difference]: Start difference. First operand 798 states and 3018 transitions. Second operand has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 29 states have internal predecessors, (65), 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-12-14 12:05:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:05:14,549 INFO L93 Difference]: Finished difference Result 1139 states and 3922 transitions. [2022-12-14 12:05:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 12:05:14,549 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 29 states have internal predecessors, (65), 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 25 [2022-12-14 12:05:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:05:14,551 INFO L225 Difference]: With dead ends: 1139 [2022-12-14 12:05:14,551 INFO L226 Difference]: Without dead ends: 1108 [2022-12-14 12:05:14,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=454, Invalid=2096, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 12:05:14,552 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 300 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:05:14,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 0 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 12:05:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-12-14 12:05:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 810. [2022-12-14 12:05:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 3.797280593325093) internal successors, (3072), 809 states have internal predecessors, (3072), 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-12-14 12:05:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3072 transitions. [2022-12-14 12:05:14,568 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3072 transitions. Word has length 25 [2022-12-14 12:05:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:05:14,569 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 3072 transitions. [2022-12-14 12:05:14,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 29 states have internal predecessors, (65), 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-12-14 12:05:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3072 transitions. [2022-12-14 12:05:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:05:14,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:05:14,570 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:05:14,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-14 12:05:14,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:05:14,772 INFO L420 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:05:14,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:05:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1112974416, now seen corresponding path program 19 times [2022-12-14 12:05:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:05:14,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981549373] [2022-12-14 12:05:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:05:14,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:05:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:05:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:05:15,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:05:15,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981549373] [2022-12-14 12:05:15,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981549373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:05:15,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027470644] [2022-12-14 12:05:15,652 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:05:15,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:05:15,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:05:15,653 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:05:15,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 12:05:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:05:15,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 12:05:15,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:05:16,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 139 [2022-12-14 12:05:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:05:16,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:05:18,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:05:18,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 531 treesize of output 375 [2022-12-14 12:05:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:05:20,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027470644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:05:20,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1211766881] [2022-12-14 12:05:20,965 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:05:20,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:05:20,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2022-12-14 12:05:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415466068] [2022-12-14 12:05:20,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:05:20,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 12:05:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:05:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 12:05:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-12-14 12:05:20,966 INFO L87 Difference]: Start difference. First operand 810 states and 3072 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 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-12-14 12:05:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:05:36,360 INFO L93 Difference]: Finished difference Result 1914 states and 5809 transitions. [2022-12-14 12:05:36,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-14 12:05:36,360 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 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 25 [2022-12-14 12:05:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:05:36,363 INFO L225 Difference]: With dead ends: 1914 [2022-12-14 12:05:36,363 INFO L226 Difference]: Without dead ends: 1866 [2022-12-14 12:05:36,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=1361, Invalid=6121, Unknown=0, NotChecked=0, Total=7482 [2022-12-14 12:05:36,363 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 469 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:05:36,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 0 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 12:05:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-12-14 12:05:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 810. [2022-12-14 12:05:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 3.7898640296662545) internal successors, (3066), 809 states have internal predecessors, (3066), 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-12-14 12:05:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3066 transitions. [2022-12-14 12:05:36,379 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3066 transitions. Word has length 25 [2022-12-14 12:05:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:05:36,380 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 3066 transitions. [2022-12-14 12:05:36,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 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-12-14 12:05:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3066 transitions. [2022-12-14 12:05:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:05:36,381 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:05:36,381 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:05:36,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 12:05:36,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:05:36,582 INFO L420 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:05:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:05:36,583 INFO L85 PathProgramCache]: Analyzing trace with hash -245878954, now seen corresponding path program 20 times [2022-12-14 12:05:36,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:05:36,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961907763] [2022-12-14 12:05:36,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:05:36,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:05:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:05:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:05:37,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:05:37,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961907763] [2022-12-14 12:05:37,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961907763] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:05:37,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779152224] [2022-12-14 12:05:37,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:05:37,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:05:37,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:05:37,589 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:05:37,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 12:05:37,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:05:37,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:05:37,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 12:05:37,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:05:38,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 125 [2022-12-14 12:05:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:05:38,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:05:40,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:05:40,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 414 treesize of output 280 [2022-12-14 12:05:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:05:40,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779152224] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:05:40,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [734273263] [2022-12-14 12:05:40,765 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:05:40,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:05:40,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 30 [2022-12-14 12:05:40,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388920470] [2022-12-14 12:05:40,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:05:40,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 12:05:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:05:40,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 12:05:40,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2022-12-14 12:05:40,766 INFO L87 Difference]: Start difference. First operand 810 states and 3066 transitions. Second operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 31 states have internal predecessors, (67), 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-12-14 12:06:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:06:17,238 INFO L93 Difference]: Finished difference Result 4823 states and 14460 transitions. [2022-12-14 12:06:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2022-12-14 12:06:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 31 states have internal predecessors, (67), 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 25 [2022-12-14 12:06:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:06:17,245 INFO L225 Difference]: With dead ends: 4823 [2022-12-14 12:06:17,246 INFO L226 Difference]: Without dead ends: 4603 [2022-12-14 12:06:17,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13365 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=5816, Invalid=32014, Unknown=0, NotChecked=0, Total=37830 [2022-12-14 12:06:17,247 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1492 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3905 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 3905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:06:17,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 0 Invalid, 4025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 3905 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-12-14 12:06:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4603 states. [2022-12-14 12:06:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4603 to 842. [2022-12-14 12:06:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 3.7919143876337693) internal successors, (3189), 841 states have internal predecessors, (3189), 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-12-14 12:06:17,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 3189 transitions. [2022-12-14 12:06:17,288 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 3189 transitions. Word has length 25 [2022-12-14 12:06:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:06:17,288 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 3189 transitions. [2022-12-14 12:06:17,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 31 states have internal predecessors, (67), 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-12-14 12:06:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 3189 transitions. [2022-12-14 12:06:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:06:17,289 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:06:17,289 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:06:17,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 12:06:17,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:06:17,491 INFO L420 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:06:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:06:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash -865580624, now seen corresponding path program 21 times [2022-12-14 12:06:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:06:17,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037468725] [2022-12-14 12:06:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:06:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:06:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:06:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:06:18,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:06:18,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037468725] [2022-12-14 12:06:18,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037468725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:06:18,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265549570] [2022-12-14 12:06:18,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:06:18,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:06:18,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:06:18,869 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:06:18,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 12:06:19,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:06:19,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:06:19,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 12:06:19,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:06:19,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 126 [2022-12-14 12:06:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:06:20,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:06:23,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:06:23,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 430 treesize of output 300 [2022-12-14 12:06:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:06:24,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265549570] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:06:24,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1763436360] [2022-12-14 12:06:24,124 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:06:24,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:06:24,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2022-12-14 12:06:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775826373] [2022-12-14 12:06:24,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:06:24,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:06:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:06:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:06:24,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 12:06:24,125 INFO L87 Difference]: Start difference. First operand 842 states and 3189 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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-12-14 12:06:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:06:44,556 INFO L93 Difference]: Finished difference Result 1943 states and 6238 transitions. [2022-12-14 12:06:44,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-14 12:06:44,557 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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 25 [2022-12-14 12:06:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:06:44,560 INFO L225 Difference]: With dead ends: 1943 [2022-12-14 12:06:44,560 INFO L226 Difference]: Without dead ends: 1905 [2022-12-14 12:06:44,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=1267, Invalid=4433, Unknown=0, NotChecked=0, Total=5700 [2022-12-14 12:06:44,560 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 590 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 12:06:44,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 0 Invalid, 2766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2706 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-14 12:06:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2022-12-14 12:06:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 860. [2022-12-14 12:06:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 3.827706635622817) internal successors, (3288), 859 states have internal predecessors, (3288), 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-12-14 12:06:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 3288 transitions. [2022-12-14 12:06:44,578 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 3288 transitions. Word has length 25 [2022-12-14 12:06:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:06:44,579 INFO L495 AbstractCegarLoop]: Abstraction has 860 states and 3288 transitions. [2022-12-14 12:06:44,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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-12-14 12:06:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 3288 transitions. [2022-12-14 12:06:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:06:44,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:06:44,580 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:06:44,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-14 12:06:44,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable210 [2022-12-14 12:06:44,781 INFO L420 AbstractCegarLoop]: === Iteration 212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:06:44,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:06:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash 918487510, now seen corresponding path program 22 times [2022-12-14 12:06:44,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:06:44,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231413260] [2022-12-14 12:06:44,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:06:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:06:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:06:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:06:45,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:06:45,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231413260] [2022-12-14 12:06:45,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231413260] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:06:45,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088613492] [2022-12-14 12:06:45,499 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:06:45,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:06:45,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:06:45,500 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:06:45,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 12:06:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:06:45,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 12:06:45,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:06:46,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 150 [2022-12-14 12:06:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:06:46,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:06:49,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:06:49,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 371 treesize of output 261 [2022-12-14 12:06:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:06:49,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088613492] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:06:49,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2050959759] [2022-12-14 12:06:49,980 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:06:49,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:06:49,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 26 [2022-12-14 12:06:49,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707869829] [2022-12-14 12:06:49,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:06:49,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 12:06:49,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:06:49,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 12:06:49,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2022-12-14 12:06:49,981 INFO L87 Difference]: Start difference. First operand 860 states and 3288 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 states have internal predecessors, (63), 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-12-14 12:07:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:07:08,141 INFO L93 Difference]: Finished difference Result 2441 states and 7668 transitions. [2022-12-14 12:07:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-12-14 12:07:08,142 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 states have internal predecessors, (63), 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 25 [2022-12-14 12:07:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:07:08,146 INFO L225 Difference]: With dead ends: 2441 [2022-12-14 12:07:08,146 INFO L226 Difference]: Without dead ends: 2362 [2022-12-14 12:07:08,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1991 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1815, Invalid=6741, Unknown=0, NotChecked=0, Total=8556 [2022-12-14 12:07:08,146 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 614 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3184 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:07:08,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 0 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3184 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 12:07:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-12-14 12:07:08,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 894. [2022-12-14 12:07:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 3.9092945128779397) internal successors, (3491), 893 states have internal predecessors, (3491), 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-12-14 12:07:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 3491 transitions. [2022-12-14 12:07:08,173 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 3491 transitions. Word has length 25 [2022-12-14 12:07:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:07:08,173 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 3491 transitions. [2022-12-14 12:07:08,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 states have internal predecessors, (63), 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-12-14 12:07:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 3491 transitions. [2022-12-14 12:07:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:07:08,174 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:07:08,174 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:07:08,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 12:07:08,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:07:08,376 INFO L420 AbstractCegarLoop]: === Iteration 213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:07:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:07:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2008466098, now seen corresponding path program 23 times [2022-12-14 12:07:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:07:08,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616736684] [2022-12-14 12:07:08,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:07:08,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:07:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:07:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:07:09,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:07:09,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616736684] [2022-12-14 12:07:09,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616736684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:07:09,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901455898] [2022-12-14 12:07:09,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:07:09,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:07:09,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:07:09,425 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:07:09,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 12:07:09,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:07:09,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:07:09,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 12:07:09,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:07:10,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 137 [2022-12-14 12:07:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:07:10,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:07:13,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:07:13,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 376 treesize of output 266 [2022-12-14 12:07:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:07:14,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901455898] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:07:14,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1552937544] [2022-12-14 12:07:14,325 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:07:14,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:07:14,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 31 [2022-12-14 12:07:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960115443] [2022-12-14 12:07:14,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:07:14,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 12:07:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:07:14,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 12:07:14,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2022-12-14 12:07:14,326 INFO L87 Difference]: Start difference. First operand 894 states and 3491 transitions. Second operand has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 states have internal predecessors, (71), 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-12-14 12:07:53,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:07:53,143 INFO L93 Difference]: Finished difference Result 2814 states and 8544 transitions. [2022-12-14 12:07:53,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-12-14 12:07:53,143 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 states have internal predecessors, (71), 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 25 [2022-12-14 12:07:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:07:53,147 INFO L225 Difference]: With dead ends: 2814 [2022-12-14 12:07:53,147 INFO L226 Difference]: Without dead ends: 2701 [2022-12-14 12:07:53,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4581 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=2688, Invalid=13062, Unknown=0, NotChecked=0, Total=15750 [2022-12-14 12:07:53,148 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 780 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4033 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 4033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-14 12:07:53,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 0 Invalid, 4132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 4033 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-12-14 12:07:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2022-12-14 12:07:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 902. [2022-12-14 12:07:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.8923418423973364) internal successors, (3507), 901 states have internal predecessors, (3507), 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-12-14 12:07:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3507 transitions. [2022-12-14 12:07:53,171 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3507 transitions. Word has length 25 [2022-12-14 12:07:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:07:53,171 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 3507 transitions. [2022-12-14 12:07:53,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 states have internal predecessors, (71), 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-12-14 12:07:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3507 transitions. [2022-12-14 12:07:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:07:53,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:07:53,172 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:07:53,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-14 12:07:53,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:07:53,374 INFO L420 AbstractCegarLoop]: === Iteration 214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:07:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:07:53,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1499660952, now seen corresponding path program 24 times [2022-12-14 12:07:53,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:07:53,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796193986] [2022-12-14 12:07:53,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:07:53,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:07:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:07:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:07:54,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:07:54,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796193986] [2022-12-14 12:07:54,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796193986] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:07:54,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510914609] [2022-12-14 12:07:54,708 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:07:54,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:07:54,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:07:54,709 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:07:54,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 12:07:54,956 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:07:54,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:07:54,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 12:07:54,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:07:55,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 91 [2022-12-14 12:07:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:07:55,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:07:57,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:07:57,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 168 [2022-12-14 12:07:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:07:57,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510914609] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:07:57,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1590530391] [2022-12-14 12:07:57,696 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:07:57,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:07:57,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2022-12-14 12:07:57,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594771379] [2022-12-14 12:07:57,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:07:57,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:07:57,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:07:57,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:07:57,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 12:07:57,697 INFO L87 Difference]: Start difference. First operand 902 states and 3507 transitions. Second operand has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 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-12-14 12:08:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:08:08,211 INFO L93 Difference]: Finished difference Result 1802 states and 6029 transitions. [2022-12-14 12:08:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 12:08:08,211 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 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 25 [2022-12-14 12:08:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:08:08,214 INFO L225 Difference]: With dead ends: 1802 [2022-12-14 12:08:08,214 INFO L226 Difference]: Without dead ends: 1773 [2022-12-14 12:08:08,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=921, Invalid=3635, Unknown=0, NotChecked=0, Total=4556 [2022-12-14 12:08:08,214 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 546 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:08:08,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 0 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 12:08:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2022-12-14 12:08:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 918. [2022-12-14 12:08:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 3.88113413304253) internal successors, (3559), 917 states have internal predecessors, (3559), 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-12-14 12:08:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 3559 transitions. [2022-12-14 12:08:08,232 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 3559 transitions. Word has length 25 [2022-12-14 12:08:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:08:08,232 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 3559 transitions. [2022-12-14 12:08:08,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 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-12-14 12:08:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 3559 transitions. [2022-12-14 12:08:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:08:08,233 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:08:08,233 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:08:08,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-14 12:08:08,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable213 [2022-12-14 12:08:08,434 INFO L420 AbstractCegarLoop]: === Iteration 215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:08:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:08:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 909692678, now seen corresponding path program 25 times [2022-12-14 12:08:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:08:08,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543054928] [2022-12-14 12:08:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:08:08,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:08:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:08:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:08:10,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:08:10,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543054928] [2022-12-14 12:08:10,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543054928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:08:10,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328900596] [2022-12-14 12:08:10,077 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:08:10,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:08:10,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:08:10,078 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:08:10,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 12:08:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:08:10,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 12:08:10,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:08:10,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 137 [2022-12-14 12:08:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:08:11,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:08:13,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:08:13,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 394 treesize of output 310 [2022-12-14 12:08:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:08:14,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328900596] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:08:14,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [419864755] [2022-12-14 12:08:14,684 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:08:14,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:08:14,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2022-12-14 12:08:14,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145114338] [2022-12-14 12:08:14,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:08:14,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:08:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:08:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:08:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 12:08:14,685 INFO L87 Difference]: Start difference. First operand 918 states and 3559 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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-12-14 12:08:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:08:33,721 INFO L93 Difference]: Finished difference Result 3697 states and 12295 transitions. [2022-12-14 12:08:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-14 12:08:33,722 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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 25 [2022-12-14 12:08:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:08:33,727 INFO L225 Difference]: With dead ends: 3697 [2022-12-14 12:08:33,727 INFO L226 Difference]: Without dead ends: 3649 [2022-12-14 12:08:33,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3434 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=2069, Invalid=9921, Unknown=0, NotChecked=0, Total=11990 [2022-12-14 12:08:33,728 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 695 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2587 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:08:33,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 0 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2587 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 12:08:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2022-12-14 12:08:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 922. [2022-12-14 12:08:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 921 states have (on average 3.8762214983713354) internal successors, (3570), 921 states have internal predecessors, (3570), 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-12-14 12:08:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 3570 transitions. [2022-12-14 12:08:33,755 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 3570 transitions. Word has length 25 [2022-12-14 12:08:33,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:08:33,755 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 3570 transitions. [2022-12-14 12:08:33,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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-12-14 12:08:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 3570 transitions. [2022-12-14 12:08:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:08:33,756 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:08:33,756 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:08:33,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-14 12:08:33,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable214 [2022-12-14 12:08:33,957 INFO L420 AbstractCegarLoop]: === Iteration 216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:08:33,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:08:33,958 INFO L85 PathProgramCache]: Analyzing trace with hash -81849414, now seen corresponding path program 26 times [2022-12-14 12:08:33,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:08:33,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655320554] [2022-12-14 12:08:33,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:08:33,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:08:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:08:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:08:35,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:08:35,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655320554] [2022-12-14 12:08:35,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655320554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:08:35,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120917027] [2022-12-14 12:08:35,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:08:35,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:08:35,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:08:35,471 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:08:35,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 12:08:35,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 12:08:35,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:08:35,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 12:08:35,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:08:36,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 151 [2022-12-14 12:08:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:08:36,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:08:40,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:08:40,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 602 treesize of output 486 [2022-12-14 12:08:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:08:42,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120917027] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:08:42,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1013502261] [2022-12-14 12:08:42,477 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:08:42,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:08:42,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2022-12-14 12:08:42,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049209982] [2022-12-14 12:08:42,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:08:42,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:08:42,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:08:42,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:08:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 12:08:42,478 INFO L87 Difference]: Start difference. First operand 922 states and 3570 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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-12-14 12:09:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:09:18,843 INFO L93 Difference]: Finished difference Result 1895 states and 6003 transitions. [2022-12-14 12:09:18,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-14 12:09:18,844 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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 25 [2022-12-14 12:09:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:09:18,846 INFO L225 Difference]: With dead ends: 1895 [2022-12-14 12:09:18,846 INFO L226 Difference]: Without dead ends: 1824 [2022-12-14 12:09:18,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=2382, Invalid=9608, Unknown=0, NotChecked=0, Total=11990 [2022-12-14 12:09:18,847 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 619 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 12:09:18,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 0 Invalid, 3122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-12-14 12:09:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2022-12-14 12:09:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 950. [2022-12-14 12:09:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.9020021074815596) internal successors, (3703), 949 states have internal predecessors, (3703), 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-12-14 12:09:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3703 transitions. [2022-12-14 12:09:18,865 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3703 transitions. Word has length 25 [2022-12-14 12:09:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:09:18,866 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 3703 transitions. [2022-12-14 12:09:18,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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-12-14 12:09:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3703 transitions. [2022-12-14 12:09:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:09:18,867 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:09:18,867 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:09:18,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 12:09:19,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable215 [2022-12-14 12:09:19,068 INFO L420 AbstractCegarLoop]: === Iteration 217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:09:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:09:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash -358641082, now seen corresponding path program 27 times [2022-12-14 12:09:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:09:19,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989655197] [2022-12-14 12:09:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:09:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:09:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:09:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:09:20,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:09:20,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989655197] [2022-12-14 12:09:20,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989655197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:09:20,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945854478] [2022-12-14 12:09:20,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:09:20,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:09:20,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:09:20,406 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:09:20,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 12:09:20,622 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:09:20,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:09:20,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 12:09:20,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:09:21,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 152 [2022-12-14 12:09:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:09:21,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:09:24,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:09:24,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 496 treesize of output 380 [2022-12-14 12:09:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:09:26,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945854478] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:09:26,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1231925806] [2022-12-14 12:09:26,615 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:09:26,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:09:26,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2022-12-14 12:09:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622675692] [2022-12-14 12:09:26,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:09:26,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:09:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:09:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:09:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 12:09:26,616 INFO L87 Difference]: Start difference. First operand 950 states and 3703 transitions. Second operand has 34 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 34 states have internal predecessors, (65), 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-12-14 12:10:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:10:16,226 INFO L93 Difference]: Finished difference Result 4662 states and 14959 transitions. [2022-12-14 12:10:16,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-12-14 12:10:16,227 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 34 states have internal predecessors, (65), 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 25 [2022-12-14 12:10:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:10:16,233 INFO L225 Difference]: With dead ends: 4662 [2022-12-14 12:10:16,234 INFO L226 Difference]: Without dead ends: 4578 [2022-12-14 12:10:16,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13185 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=6477, Invalid=30965, Unknown=0, NotChecked=0, Total=37442 [2022-12-14 12:10:16,235 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 972 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4005 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 4005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-14 12:10:16,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 0 Invalid, 4129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 4005 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-12-14 12:10:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2022-12-14 12:10:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 983. [2022-12-14 12:10:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 3.9521384928716903) internal successors, (3881), 982 states have internal predecessors, (3881), 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-12-14 12:10:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3881 transitions. [2022-12-14 12:10:16,270 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3881 transitions. Word has length 25 [2022-12-14 12:10:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:10:16,270 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 3881 transitions. [2022-12-14 12:10:16,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 34 states have internal predecessors, (65), 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-12-14 12:10:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3881 transitions. [2022-12-14 12:10:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:10:16,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:10:16,272 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:10:16,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-14 12:10:16,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable216 [2022-12-14 12:10:16,473 INFO L420 AbstractCegarLoop]: === Iteration 218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:10:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:10:16,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1502769988, now seen corresponding path program 28 times [2022-12-14 12:10:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:10:16,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465430722] [2022-12-14 12:10:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:10:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:10:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:10:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:10:17,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:10:17,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465430722] [2022-12-14 12:10:17,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465430722] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:10:17,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191334915] [2022-12-14 12:10:17,400 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:10:17,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:10:17,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:10:17,401 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:10:17,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 12:10:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:10:17,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 12:10:17,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:10:17,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 89 [2022-12-14 12:10:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:10:18,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:10:20,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:10:20,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 383 treesize of output 323 [2022-12-14 12:10:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:10:21,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191334915] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:10:21,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [731933805] [2022-12-14 12:10:21,891 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:10:21,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:10:21,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2022-12-14 12:10:21,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725054284] [2022-12-14 12:10:21,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:10:21,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 12:10:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:10:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 12:10:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2022-12-14 12:10:21,892 INFO L87 Difference]: Start difference. First operand 983 states and 3881 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 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-12-14 12:10:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:10:34,956 INFO L93 Difference]: Finished difference Result 1902 states and 6224 transitions. [2022-12-14 12:10:34,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-14 12:10:34,957 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 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 25 [2022-12-14 12:10:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:10:34,960 INFO L225 Difference]: With dead ends: 1902 [2022-12-14 12:10:34,960 INFO L226 Difference]: Without dead ends: 1895 [2022-12-14 12:10:34,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=1133, Invalid=5029, Unknown=0, NotChecked=0, Total=6162 [2022-12-14 12:10:34,960 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 347 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 12:10:34,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 0 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-14 12:10:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2022-12-14 12:10:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 981. [2022-12-14 12:10:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.951020408163265) internal successors, (3872), 980 states have internal predecessors, (3872), 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-12-14 12:10:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3872 transitions. [2022-12-14 12:10:34,979 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3872 transitions. Word has length 25 [2022-12-14 12:10:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:10:34,979 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 3872 transitions. [2022-12-14 12:10:34,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 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-12-14 12:10:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3872 transitions. [2022-12-14 12:10:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:10:34,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:10:34,980 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:10:34,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-14 12:10:35,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable217 [2022-12-14 12:10:35,182 INFO L420 AbstractCegarLoop]: === Iteration 219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:10:35,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:10:35,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1393622752, now seen corresponding path program 29 times [2022-12-14 12:10:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:10:35,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433468448] [2022-12-14 12:10:35,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:10:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:10:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:10:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:10:36,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:10:36,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433468448] [2022-12-14 12:10:36,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433468448] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:10:36,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581621157] [2022-12-14 12:10:36,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:10:36,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:10:36,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:10:36,188 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:10:36,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 12:10:36,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:10:36,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:10:36,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 12:10:36,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:10:36,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 111 [2022-12-14 12:10:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:10:37,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:10:39,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:10:39,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 402 [2022-12-14 12:10:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:10:41,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581621157] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:10:41,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [896698699] [2022-12-14 12:10:41,342 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:10:41,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:10:41,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 28 [2022-12-14 12:10:41,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815937750] [2022-12-14 12:10:41,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:10:41,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 12:10:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:10:41,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 12:10:41,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-12-14 12:10:41,344 INFO L87 Difference]: Start difference. First operand 981 states and 3872 transitions. Second operand has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 29 states have internal predecessors, (65), 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-12-14 12:10:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:10:47,881 INFO L93 Difference]: Finished difference Result 1306 states and 4738 transitions. [2022-12-14 12:10:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 12:10:47,882 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 29 states have internal predecessors, (65), 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 25 [2022-12-14 12:10:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:10:47,884 INFO L225 Difference]: With dead ends: 1306 [2022-12-14 12:10:47,884 INFO L226 Difference]: Without dead ends: 1275 [2022-12-14 12:10:47,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=442, Invalid=2008, Unknown=0, NotChecked=0, Total=2450 [2022-12-14 12:10:47,884 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 255 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 12:10:47,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 0 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 12:10:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-12-14 12:10:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 993. [2022-12-14 12:10:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 992 states have (on average 3.9485887096774195) internal successors, (3917), 992 states have internal predecessors, (3917), 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-12-14 12:10:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 3917 transitions. [2022-12-14 12:10:47,899 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 3917 transitions. Word has length 25 [2022-12-14 12:10:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:10:47,899 INFO L495 AbstractCegarLoop]: Abstraction has 993 states and 3917 transitions. [2022-12-14 12:10:47,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 29 states have internal predecessors, (65), 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-12-14 12:10:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 3917 transitions. [2022-12-14 12:10:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:10:47,900 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:10:47,901 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:10:47,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-14 12:10:48,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:10:48,102 INFO L420 AbstractCegarLoop]: === Iteration 220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:10:48,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:10:48,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1300294206, now seen corresponding path program 30 times [2022-12-14 12:10:48,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:10:48,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668262397] [2022-12-14 12:10:48,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:10:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:10:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:10:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:10:49,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:10:49,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668262397] [2022-12-14 12:10:49,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668262397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:10:49,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584231398] [2022-12-14 12:10:49,361 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:10:49,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:10:49,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:10:49,362 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:10:49,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 12:10:49,602 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:10:49,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:10:49,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 12:10:49,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:10:49,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:10:49,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2022-12-14 12:10:50,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 139 [2022-12-14 12:10:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:10:50,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:10:52,168 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_6648 (Array Int Int))) (not (= c_~name_3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6648) c_~nondet_0~0.base) c_~nondet_0~0.offset))))) (.cse1 (forall ((v_ArrVal_6648 (Array Int Int))) (= c_~name_3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6648) c_~nondet_0~0.base) c_~nondet_0~0.offset)))) (.cse2 (= c_~break_11~0 0))) (and (or (and (or .cse0 (< c_~name_1~0 c_~name_3~0)) (or (< c_~name_3~0 c_~name_1~0) .cse1)) (not (<= c_~name_1~0 (+ c_~name_3~0 2147483647))) (not .cse2) (not (<= c_~name_3~0 (+ c_~name_1~0 2147483648))) (< c_~i_9~0 3)) (or (and (or .cse0 (< c_~result_8~0 0)) (or (< 0 c_~result_8~0) .cse1)) .cse2))) is different from false [2022-12-14 12:10:52,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:10:52,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 264 treesize of output 194 [2022-12-14 12:10:52,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 115 [2022-12-14 12:10:52,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 113 [2022-12-14 12:10:52,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 111 [2022-12-14 12:10:52,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 109 [2022-12-14 12:10:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:10:52,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584231398] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:10:52,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [6055279] [2022-12-14 12:10:52,571 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:10:52,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:10:52,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 32 [2022-12-14 12:10:52,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399688091] [2022-12-14 12:10:52,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:10:52,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:10:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:10:52,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:10:52,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=958, Unknown=1, NotChecked=62, Total=1122 [2022-12-14 12:10:52,573 INFO L87 Difference]: Start difference. First operand 993 states and 3917 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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-12-14 12:11:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:04,077 INFO L93 Difference]: Finished difference Result 2061 states and 7317 transitions. [2022-12-14 12:11:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 12:11:04,077 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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 25 [2022-12-14 12:11:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:04,080 INFO L225 Difference]: With dead ends: 2061 [2022-12-14 12:11:04,080 INFO L226 Difference]: Without dead ends: 2046 [2022-12-14 12:11:04,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1402, Invalid=5081, Unknown=1, NotChecked=158, Total=6642 [2022-12-14 12:11:04,081 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 710 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:04,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 0 Invalid, 2841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2683 Invalid, 0 Unknown, 109 Unchecked, 2.1s Time] [2022-12-14 12:11:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-12-14 12:11:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1006. [2022-12-14 12:11:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 3.9601990049751246) internal successors, (3980), 1005 states have internal predecessors, (3980), 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-12-14 12:11:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3980 transitions. [2022-12-14 12:11:04,116 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3980 transitions. Word has length 25 [2022-12-14 12:11:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:04,116 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 3980 transitions. [2022-12-14 12:11:04,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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-12-14 12:11:04,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3980 transitions. [2022-12-14 12:11:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:11:04,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:04,119 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:04,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-14 12:11:04,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:04,319 INFO L420 AbstractCegarLoop]: === Iteration 221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:11:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1059002316, now seen corresponding path program 31 times [2022-12-14 12:11:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:04,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207512194] [2022-12-14 12:11:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:04,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:05,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:05,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207512194] [2022-12-14 12:11:05,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207512194] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:05,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247194795] [2022-12-14 12:11:05,340 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:11:05,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:05,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:05,341 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:05,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 12:11:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:05,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 12:11:05,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:05,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:05,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-14 12:11:06,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 97 [2022-12-14 12:11:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:06,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:09,297 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (< c_~i_9~0 3))) (and (or (forall ((v_ArrVal_6701 (Array Int Int))) (not (= c_~name_1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6701) c_~nondet_0~0.base) c_~nondet_0~0.offset)))) (and (or (< c_~name_3~0 c_~name_1~0) (not (<= c_~name_3~0 (+ c_~name_1~0 2147483648))) .cse0) (< 0 c_~result_8~0))) (or (forall ((v_ArrVal_6701 (Array Int Int))) (not (= c_~name_3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6701) c_~nondet_0~0.base) c_~nondet_0~0.offset)))) (and (or (not (<= c_~name_1~0 (+ c_~name_3~0 2147483647))) (< c_~name_1~0 c_~name_3~0) .cse0) (< c_~result_8~0 0))))) (= c_~name_3~0 c_~name_1~0)) is different from false [2022-12-14 12:11:09,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:11:09,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 130 [2022-12-14 12:11:09,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2022-12-14 12:11:09,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2022-12-14 12:11:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:09,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247194795] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:09,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1827163177] [2022-12-14 12:11:09,573 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:11:09,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:09,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-12-14 12:11:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179029262] [2022-12-14 12:11:09,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:09,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:11:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:09,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:11:09,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=4, NotChecked=62, Total=1122 [2022-12-14 12:11:09,574 INFO L87 Difference]: Start difference. First operand 1006 states and 3980 transitions. Second operand has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 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-12-14 12:11:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:28,353 INFO L93 Difference]: Finished difference Result 1894 states and 6528 transitions. [2022-12-14 12:11:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 12:11:28,354 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 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 25 [2022-12-14 12:11:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:28,357 INFO L225 Difference]: With dead ends: 1894 [2022-12-14 12:11:28,357 INFO L226 Difference]: Without dead ends: 1861 [2022-12-14 12:11:28,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=1518, Invalid=5454, Unknown=4, NotChecked=164, Total=7140 [2022-12-14 12:11:28,357 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 484 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2984 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:28,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 0 Invalid, 3211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2984 Invalid, 0 Unknown, 132 Unchecked, 2.9s Time] [2022-12-14 12:11:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2022-12-14 12:11:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1026. [2022-12-14 12:11:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 3.984390243902439) internal successors, (4084), 1025 states have internal predecessors, (4084), 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-12-14 12:11:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 4084 transitions. [2022-12-14 12:11:28,377 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 4084 transitions. Word has length 25 [2022-12-14 12:11:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:28,377 INFO L495 AbstractCegarLoop]: Abstraction has 1026 states and 4084 transitions. [2022-12-14 12:11:28,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 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-12-14 12:11:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 4084 transitions. [2022-12-14 12:11:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:11:28,378 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:28,378 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:28,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-14 12:11:28,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:28,580 INFO L420 AbstractCegarLoop]: === Iteration 222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:11:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1343541542, now seen corresponding path program 32 times [2022-12-14 12:11:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:28,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134902553] [2022-12-14 12:11:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:29,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:29,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134902553] [2022-12-14 12:11:29,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134902553] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:29,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165258641] [2022-12-14 12:11:29,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:11:29,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:29,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:29,379 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:29,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 12:11:29,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 12:11:29,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:11:29,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 12:11:29,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:29,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:29,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2022-12-14 12:11:30,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 89 [2022-12-14 12:11:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:30,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:33,782 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~break_11~0 0))) (let ((.cse3 (< c_~result_8~0 0)) (.cse1 (< c_~name_1~0 c_~name_3~0)) (.cse0 (not .cse4)) (.cse5 (not (<= c_~name_3~0 (+ c_~name_1~0 2147483648)))) (.cse2 (< c_~i_9~0 3))) (and (or (and (or .cse0 (< (+ c_~name_3~0 2147483647) c_~name_1~0) .cse1 .cse2) (or .cse3 .cse4)) (forall ((v_ArrVal_6754 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6754) c_~nondet_0~0.base) c_~nondet_0~0.offset) c_~name_1~0))) (or (forall ((v_ArrVal_6754 (Array Int Int))) (= c_~name_3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6754) c_~nondet_0~0.base) c_~nondet_0~0.offset))) (and (or (not .cse3) .cse4) (or .cse0 .cse5 (not .cse1) .cse2))) (or (and (or (< c_~name_3~0 c_~name_1~0) .cse0 .cse5 .cse2) (or .cse4 (< 0 c_~result_8~0))) (forall ((v_ArrVal_6754 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6754) c_~nondet_0~0.base) c_~nondet_0~0.offset) c_~name_1~0))))))) is different from false [2022-12-14 12:11:33,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:11:33,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 211 [2022-12-14 12:11:33,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 132 [2022-12-14 12:11:33,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 130 [2022-12-14 12:11:33,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 128 [2022-12-14 12:11:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:34,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165258641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:34,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2080121064] [2022-12-14 12:11:34,112 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:11:34,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:34,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-12-14 12:11:34,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437744340] [2022-12-14 12:11:34,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:34,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:11:34,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:34,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:11:34,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=937, Unknown=2, NotChecked=62, Total=1122 [2022-12-14 12:11:34,113 INFO L87 Difference]: Start difference. First operand 1026 states and 4084 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 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-12-14 12:11:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:40,684 INFO L93 Difference]: Finished difference Result 1800 states and 6608 transitions. [2022-12-14 12:11:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 12:11:40,684 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 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 25 [2022-12-14 12:11:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:40,687 INFO L225 Difference]: With dead ends: 1800 [2022-12-14 12:11:40,687 INFO L226 Difference]: Without dead ends: 1779 [2022-12-14 12:11:40,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=997, Invalid=3427, Unknown=2, NotChecked=130, Total=4556 [2022-12-14 12:11:40,688 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 348 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:40,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 0 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2333 Invalid, 0 Unknown, 86 Unchecked, 2.0s Time] [2022-12-14 12:11:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2022-12-14 12:11:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1032. [2022-12-14 12:11:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1031 states have (on average 3.988360814742968) internal successors, (4112), 1031 states have internal predecessors, (4112), 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-12-14 12:11:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 4112 transitions. [2022-12-14 12:11:40,711 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 4112 transitions. Word has length 25 [2022-12-14 12:11:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:40,711 INFO L495 AbstractCegarLoop]: Abstraction has 1032 states and 4112 transitions. [2022-12-14 12:11:40,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 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-12-14 12:11:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 4112 transitions. [2022-12-14 12:11:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:11:40,712 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:40,713 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:40,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-14 12:11:40,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable221 [2022-12-14 12:11:40,914 INFO L420 AbstractCegarLoop]: === Iteration 223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:11:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash -87721124, now seen corresponding path program 33 times [2022-12-14 12:11:40,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:40,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622437802] [2022-12-14 12:11:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:40,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:11:42,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:42,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622437802] [2022-12-14 12:11:42,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622437802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:42,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860477004] [2022-12-14 12:11:42,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:11:42,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:42,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:42,179 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:42,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-14 12:11:42,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:11:42,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:11:42,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 12:11:42,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:42,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:42,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2022-12-14 12:11:43,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 86 [2022-12-14 12:11:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:43,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:45,968 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~break_11~0 0)) (.cse2 (forall ((v_ArrVal_6807 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6807) c_~nondet_0~0.base) c_~nondet_0~0.offset) c_~name_2~0)))) (.cse7 (= c_~break_7~0 0)) (.cse1 (< c_~i_5~0 3)) (.cse6 (forall ((v_ArrVal_6807 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6807) c_~nondet_0~0.base) c_~nondet_0~0.offset))) (or (= .cse9 c_~name_2~0) (not (= c_~name_3~0 .cse9)))))) (.cse4 (not (= c_~name_1~0 c_~name_2~0)))) (and (or .cse0 (let ((.cse5 (< c_~result_8~0 0)) (.cse3 (< 0 c_~result_8~0))) (and (or .cse1 (and (or .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse4))) (or (and (or .cse5 .cse6) (or .cse2 .cse3)) .cse7)))) (or (not (<= c_~name_1~0 (+ c_~name_3~0 2147483647))) (not .cse0) (not (<= c_~name_3~0 (+ c_~name_1~0 2147483648))) (let ((.cse8 (< c_~name_1~0 c_~name_3~0))) (and (or (< c_~name_3~0 c_~name_1~0) .cse2 (and (or .cse1 .cse4) .cse7)) (or .cse6 .cse8 .cse7) (or .cse1 .cse6 .cse8 .cse4))) (< c_~i_9~0 3)))) is different from false [2022-12-14 12:11:46,020 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~break_11~0 0)) (.cse1 (forall ((v_ArrVal_6807 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6807) c_~nondet_0~0.base) c_~nondet_0~0.offset))) (or (= c_~name_1~0 .cse3) (not (= c_~name_3~0 .cse3)))))) (.cse0 (forall ((v_ArrVal_6807 (Array Int Int))) (not (= c_~name_1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6807) c_~nondet_0~0.base) c_~nondet_0~0.offset)))))) (and (or (and (or (< 0 c_~result_8~0) .cse0) (or .cse1 (< c_~result_8~0 0))) .cse2) (or (not (<= c_~name_1~0 (+ c_~name_3~0 2147483647))) (not .cse2) (not (<= c_~name_3~0 (+ c_~name_1~0 2147483648))) (and (or .cse1 (< c_~name_1~0 c_~name_3~0)) (or (< c_~name_3~0 c_~name_1~0) .cse0)) (< c_~i_9~0 3)))) is different from false [2022-12-14 12:11:46,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:11:46,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 248 [2022-12-14 12:11:46,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 153 [2022-12-14 12:11:46,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 151 [2022-12-14 12:11:46,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 147 [2022-12-14 12:11:46,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 145 [2022-12-14 12:11:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:46,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860477004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:46,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1954215677] [2022-12-14 12:11:46,418 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:11:46,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:46,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 36 [2022-12-14 12:11:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780358214] [2022-12-14 12:11:46,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:46,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 12:11:46,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:46,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 12:11:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1143, Unknown=2, NotChecked=138, Total=1406 [2022-12-14 12:11:46,419 INFO L87 Difference]: Start difference. First operand 1032 states and 4112 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 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-12-14 12:11:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:53,260 INFO L93 Difference]: Finished difference Result 1581 states and 5819 transitions. [2022-12-14 12:11:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 12:11:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 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 25 [2022-12-14 12:11:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:53,263 INFO L225 Difference]: With dead ends: 1581 [2022-12-14 12:11:53,263 INFO L226 Difference]: Without dead ends: 1548 [2022-12-14 12:11:53,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=595, Invalid=2833, Unknown=2, NotChecked=230, Total=3660 [2022-12-14 12:11:53,264 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 374 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:53,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 0 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2005 Invalid, 0 Unknown, 231 Unchecked, 1.6s Time] [2022-12-14 12:11:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-12-14 12:11:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1044. [2022-12-14 12:11:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 3.99137104506232) internal successors, (4163), 1043 states have internal predecessors, (4163), 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-12-14 12:11:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 4163 transitions. [2022-12-14 12:11:53,280 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 4163 transitions. Word has length 25 [2022-12-14 12:11:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:53,280 INFO L495 AbstractCegarLoop]: Abstraction has 1044 states and 4163 transitions. [2022-12-14 12:11:53,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 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-12-14 12:11:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 4163 transitions. [2022-12-14 12:11:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:11:53,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:53,281 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:53,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-14 12:11:53,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable222 [2022-12-14 12:11:53,483 INFO L420 AbstractCegarLoop]: === Iteration 224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:11:53,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1998541678, now seen corresponding path program 34 times [2022-12-14 12:11:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:53,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450991539] [2022-12-14 12:11:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:54,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:54,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450991539] [2022-12-14 12:11:54,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450991539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:54,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151030422] [2022-12-14 12:11:54,290 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:11:54,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:54,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:54,291 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:54,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-14 12:11:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:54,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 12:11:54,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:54,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:54,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2022-12-14 12:11:55,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 124 [2022-12-14 12:11:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:55,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:57,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:11:57,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 201 [2022-12-14 12:11:57,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2022-12-14 12:11:57,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2022-12-14 12:11:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:58,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151030422] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:58,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [17452976] [2022-12-14 12:11:58,002 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:11:58,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:58,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-12-14 12:11:58,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789177907] [2022-12-14 12:11:58,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:58,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:11:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:11:58,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=996, Unknown=2, NotChecked=0, Total=1122 [2022-12-14 12:11:58,004 INFO L87 Difference]: Start difference. First operand 1044 states and 4163 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 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-12-14 12:12:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:12:11,425 INFO L93 Difference]: Finished difference Result 2324 states and 7935 transitions. [2022-12-14 12:12:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-14 12:12:11,426 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 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 25 [2022-12-14 12:12:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:12:11,430 INFO L225 Difference]: With dead ends: 2324 [2022-12-14 12:12:11,430 INFO L226 Difference]: Without dead ends: 2284 [2022-12-14 12:12:11,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1257, Invalid=4291, Unknown=2, NotChecked=0, Total=5550 [2022-12-14 12:12:11,430 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 708 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:12:11,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 0 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 12:12:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2022-12-14 12:12:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 1050. [2022-12-14 12:12:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1049 states have (on average 3.9685414680648234) internal successors, (4163), 1049 states have internal predecessors, (4163), 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-12-14 12:12:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 4163 transitions. [2022-12-14 12:12:11,453 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 4163 transitions. Word has length 25 [2022-12-14 12:12:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:12:11,453 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 4163 transitions. [2022-12-14 12:12:11,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 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-12-14 12:12:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 4163 transitions. [2022-12-14 12:12:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:12:11,454 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:12:11,454 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:12:11,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-14 12:12:11,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:12:11,656 INFO L420 AbstractCegarLoop]: === Iteration 225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 12:12:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:12:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1957861086, now seen corresponding path program 35 times [2022-12-14 12:12:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:12:11,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47048931] [2022-12-14 12:12:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:12:11,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:12:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:12:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:12:12,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:12:12,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47048931] [2022-12-14 12:12:12,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47048931] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:12:12,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144408249] [2022-12-14 12:12:12,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:12:12,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:12:12,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:12:12,952 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:12:12,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9607b24b-d590-4971-b0c1-a7b91bc416b9/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-14 12:12:13,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:12:13,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:12:13,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 12:12:13,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:12:13,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:13,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2022-12-14 12:12:13,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 107 [2022-12-14 12:12:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:12:14,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:12:16,363 WARN L837 $PredicateComparison]: unable to prove that (or (= c_~name_3~0 c_~name_1~0) (let ((.cse2 (+ c_~name_3~0 2147483647)) (.cse9 (= c_~break_11~0 0)) (.cse6 (+ c_~name_1~0 2147483648)) (.cse4 (< c_~name_3~0 c_~name_1~0)) (.cse8 (forall ((v_ArrVal_6913 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6913) c_~nondet_0~0.base) c_~nondet_0~0.offset) c_~name_1~0)))) (.cse1 (forall ((v_ArrVal_6913 (Array Int Int))) (not (= c_~name_3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6913) c_~nondet_0~0.base) c_~nondet_0~0.offset))))) (.cse3 (< c_~name_1~0 c_~name_3~0))) (and (or (let ((.cse0 (< c_~result_8~0 0)) (.cse5 (< 0 c_~result_8~0))) (and (or .cse0 .cse1) (or (< .cse2 c_~name_1~0) (and (or (not .cse0) .cse3) (or (and .cse4 .cse5) .cse0)) (< .cse6 c_~name_3~0) (forall ((v_ArrVal_6913 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6913) c_~nondet_0~0.base) c_~nondet_0~0.offset))) (or (= .cse7 c_~name_1~0) (= c_~name_3~0 .cse7))))) (or .cse8 .cse5))) .cse9) (or (not (<= c_~name_1~0 .cse2)) (not .cse9) (not (<= c_~name_3~0 .cse6)) (and (or .cse4 .cse8) (or .cse1 .cse3)) (< c_~i_9~0 3))))) is different from false [2022-12-14 12:12:16,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:12:16,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 427 treesize of output 317 [2022-12-14 12:12:16,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 184 [2022-12-14 12:12:16,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 182 [2022-12-14 12:12:16,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 180 [2022-12-14 12:12:16,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 178 [2022-12-14 12:12:16,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 176 [2022-12-14 12:12:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:12:17,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144408249] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:12:17,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [916792822] [2022-12-14 12:12:17,085 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:12:17,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:12:17,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 36 [2022-12-14 12:12:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537319871] [2022-12-14 12:12:17,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:12:17,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 12:12:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:12:17,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 12:12:17,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1214, Unknown=1, NotChecked=70, Total=1406 [2022-12-14 12:12:17,086 INFO L87 Difference]: Start difference. First operand 1050 states and 4163 transitions. Second operand has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 37 states have internal predecessors, (65), 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)