./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/atomic-gcc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9bd2c7ff 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_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/atomic-gcc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e871b2733ca48641b94165aca85ae57dbaeb869d27034829a9a99745860b5f9f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:51:23,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:51:23,331 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-19 04:51:23,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:51:23,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:51:23,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:51:23,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:51:23,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:51:23,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:51:23,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:51:23,394 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:51:23,395 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:51:23,396 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:51:23,398 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:51:23,398 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:51:23,399 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:51:23,399 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:51:23,400 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:51:23,400 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:51:23,401 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:51:23,402 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:51:23,403 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:51:23,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:51:23,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:51:23,406 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:51:23,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:51:23,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:51:23,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:51:23,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:51:23,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:51:23,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:51:23,410 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-19 04:51:23,410 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:51:23,410 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:51:23,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:51:23,411 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:51:23,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:51:23,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:51:23,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:51:23,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:51:23,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:51:23,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:51:23,413 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:51:23,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:51:23,414 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:51:23,414 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:51:23,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:51:23,414 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/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_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! data-race) ) 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 -> e871b2733ca48641b94165aca85ae57dbaeb869d27034829a9a99745860b5f9f [2023-11-19 04:51:23,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:51:23,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:51:23,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:51:23,825 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:51:23,826 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:51:23,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-race-challenges/atomic-gcc.i [2023-11-19 04:51:27,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:51:27,446 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:51:27,447 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/sv-benchmarks/c/pthread-race-challenges/atomic-gcc.i [2023-11-19 04:51:27,477 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/data/e52940c6c/f6b09b8113f0401a837a945a9c2210ca/FLAG41eb23655 [2023-11-19 04:51:27,497 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/data/e52940c6c/f6b09b8113f0401a837a945a9c2210ca [2023-11-19 04:51:27,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:51:27,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:51:27,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:51:27,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:51:27,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:51:27,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:51:27" (1/1) ... [2023-11-19 04:51:27,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c324911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:27, skipping insertion in model container [2023-11-19 04:51:27,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:51:27" (1/1) ... [2023-11-19 04:51:27,584 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:51:27,785 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 04:51:28,169 WARN L635 FunctionHandler]: implicit declaration of function __sync_fetch_and_add [2023-11-19 04:51:28,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:51:28,218 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:51:28,242 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 04:51:28,282 WARN L635 FunctionHandler]: implicit declaration of function __sync_fetch_and_add [2023-11-19 04:51:28,293 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:51:28,383 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:51:28,384 WARN L675 CHandler]: The function __sync_fetch_and_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:51:28,393 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:51:28,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28 WrapperNode [2023-11-19 04:51:28,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:51:28,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:51:28,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:51:28,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:51:28,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,505 INFO L138 Inliner]: procedures = 269, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2023-11-19 04:51:28,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:51:28,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:51:28,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:51:28,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:51:28,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:51:28,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:51:28,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:51:28,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:51:28,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (1/1) ... [2023-11-19 04:51:28,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:51:28,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:51:28,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:51:28,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b1c07d2-0af6-4db1-b6f9-6f5f131ed0db/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:51:28,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:51:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:51:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:51:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 04:51:28,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:51:28,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:51:28,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:51:28,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:51:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure __sync_fetch_and_add [2023-11-19 04:51:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:51:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-19 04:51:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-19 04:51:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:51:28,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:51:28,667 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:51:28,864 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:51:28,867 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:51:29,143 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:51:29,161 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:51:29,162 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 04:51:29,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:51:29 BoogieIcfgContainer [2023-11-19 04:51:29,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:51:29,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:51:29,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:51:29,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:51:29,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:51:27" (1/3) ... [2023-11-19 04:51:29,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b659765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:51:29, skipping insertion in model container [2023-11-19 04:51:29,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:28" (2/3) ... [2023-11-19 04:51:29,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b659765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:51:29, skipping insertion in model container [2023-11-19 04:51:29,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:51:29" (3/3) ... [2023-11-19 04:51:29,178 INFO L112 eAbstractionObserver]: Analyzing ICFG atomic-gcc.i [2023-11-19 04:51:29,186 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 04:51:29,195 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:51:29,195 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-19 04:51:29,196 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:51:29,264 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-19 04:51:29,310 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:51:29,347 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 92 transitions, 191 flow [2023-11-19 04:51:29,361 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 92 transitions, 191 flow [2023-11-19 04:51:29,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 92 transitions, 191 flow [2023-11-19 04:51:29,448 INFO L124 PetriNetUnfolderBase]: 6/140 cut-off events. [2023-11-19 04:51:29,450 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 04:51:29,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 140 events. 6/140 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 238 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 72. Up to 4 conditions per place. [2023-11-19 04:51:29,462 INFO L119 LiptonReduction]: Number of co-enabled transitions 660 [2023-11-19 04:51:34,528 INFO L134 LiptonReduction]: Checked pairs total: 600 [2023-11-19 04:51:34,528 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-11-19 04:51:34,536 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 17 places, 15 transitions, 37 flow [2023-11-19 04:51:34,550 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 32 states, 21 states have (on average 2.0) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:34,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:51:34,576 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=LoopHeads, 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;@5dd255b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:51:34,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 04:51:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 2.0) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 04:51:34,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:34,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 04:51:34,586 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:51:34,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash 10684, now seen corresponding path program 1 times [2023-11-19 04:51:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:34,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391277215] [2023-11-19 04:51:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:34,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:34,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:34,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391277215] [2023-11-19 04:51:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391277215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:34,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:34,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:51:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36363779] [2023-11-19 04:51:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:34,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:51:34,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:34,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:51:34,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:51:34,889 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 2.0) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:34,936 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2023-11-19 04:51:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:51:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-19 04:51:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:34,947 INFO L225 Difference]: With dead ends: 20 [2023-11-19 04:51:34,947 INFO L226 Difference]: Without dead ends: 11 [2023-11-19 04:51:34,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:51:34,955 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:34,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:51:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-19 04:51:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-19 04:51:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-11-19 04:51:34,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 2 [2023-11-19 04:51:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:34,996 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-11-19 04:51:34,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-11-19 04:51:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:51:34,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:34,998 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-11-19 04:51:34,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:51:35,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:51:35,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:35,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1282678679, now seen corresponding path program 1 times [2023-11-19 04:51:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:35,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236471326] [2023-11-19 04:51:35,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:35,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:35,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:51:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:35,155 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:51:35,155 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:51:35,157 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-19 04:51:35,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-19 04:51:35,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-19 04:51:35,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-19 04:51:35,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-19 04:51:35,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:51:35,164 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 04:51:35,166 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 04:51:35,166 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 04:51:35,186 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-19 04:51:35,191 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:51:35,191 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 100 transitions, 216 flow [2023-11-19 04:51:35,192 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 100 transitions, 216 flow [2023-11-19 04:51:35,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 100 transitions, 216 flow [2023-11-19 04:51:35,274 INFO L124 PetriNetUnfolderBase]: 11/247 cut-off events. [2023-11-19 04:51:35,274 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-19 04:51:35,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 247 events. 11/247 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 496 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 142. Up to 8 conditions per place. [2023-11-19 04:51:35,279 INFO L119 LiptonReduction]: Number of co-enabled transitions 1548 [2023-11-19 04:51:40,053 INFO L134 LiptonReduction]: Checked pairs total: 1376 [2023-11-19 04:51:40,054 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-11-19 04:51:40,055 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 20 transitions, 56 flow [2023-11-19 04:51:40,068 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 101 states, 81 states have (on average 2.0987654320987654) internal successors, (170), 100 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:40,070 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:51:40,071 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=LoopHeads, 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;@5dd255b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:51:40,071 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 04:51:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 2.0987654320987654) internal successors, (170), 100 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 04:51:40,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:40,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 04:51:40,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:51:40,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:40,075 INFO L85 PathProgramCache]: Analyzing trace with hash 17298, now seen corresponding path program 1 times [2023-11-19 04:51:40,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:40,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793339053] [2023-11-19 04:51:40,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:40,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:40,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:40,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793339053] [2023-11-19 04:51:40,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793339053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:40,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:40,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:51:40,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581173780] [2023-11-19 04:51:40,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:40,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:51:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:40,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:51:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:51:40,145 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 2.0987654320987654) internal successors, (170), 100 states have internal predecessors, (170), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:40,182 INFO L93 Difference]: Finished difference Result 67 states and 113 transitions. [2023-11-19 04:51:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:51:40,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-19 04:51:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:40,184 INFO L225 Difference]: With dead ends: 67 [2023-11-19 04:51:40,184 INFO L226 Difference]: Without dead ends: 31 [2023-11-19 04:51:40,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:51:40,187 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:40,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:51:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-19 04:51:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-19 04:51:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2023-11-19 04:51:40,195 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 2 [2023-11-19 04:51:40,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:40,195 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2023-11-19 04:51:40,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:40,196 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2023-11-19 04:51:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:51:40,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:40,197 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 04:51:40,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:51:40,197 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:51:40,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:40,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1175624032, now seen corresponding path program 1 times [2023-11-19 04:51:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:40,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704911737] [2023-11-19 04:51:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:40,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:51:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:40,302 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:51:40,303 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:51:40,303 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-19 04:51:40,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-19 04:51:40,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-19 04:51:40,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-19 04:51:40,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-19 04:51:40,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:51:40,305 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 04:51:40,305 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 04:51:40,306 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-19 04:51:40,325 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-19 04:51:40,328 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:51:40,329 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 108 transitions, 243 flow [2023-11-19 04:51:40,329 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 108 transitions, 243 flow [2023-11-19 04:51:40,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 108 transitions, 243 flow [2023-11-19 04:51:40,403 INFO L124 PetriNetUnfolderBase]: 21/435 cut-off events. [2023-11-19 04:51:40,403 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-19 04:51:40,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 435 events. 21/435 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1171 event pairs, 1 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 255. Up to 16 conditions per place. [2023-11-19 04:51:40,412 INFO L119 LiptonReduction]: Number of co-enabled transitions 2484 [2023-11-19 04:51:44,865 INFO L134 LiptonReduction]: Checked pairs total: 2536 [2023-11-19 04:51:44,866 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-11-19 04:51:44,867 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 23 transitions, 73 flow [2023-11-19 04:51:44,912 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 281 states, 244 states have (on average 2.3647540983606556) internal successors, (577), 280 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:44,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:51:44,925 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=LoopHeads, 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;@5dd255b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:51:44,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 04:51:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 281 states, 244 states have (on average 2.3647540983606556) internal successors, (577), 280 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 04:51:44,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:44,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 04:51:44,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:51:44,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash 24376, now seen corresponding path program 1 times [2023-11-19 04:51:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:44,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030953809] [2023-11-19 04:51:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:44,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:44,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030953809] [2023-11-19 04:51:44,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030953809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:44,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:44,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:51:44,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175388704] [2023-11-19 04:51:44,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:44,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:51:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:44,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:51:44,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:51:44,987 INFO L87 Difference]: Start difference. First operand has 281 states, 244 states have (on average 2.3647540983606556) internal successors, (577), 280 states have internal predecessors, (577), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:45,040 INFO L93 Difference]: Finished difference Result 185 states and 383 transitions. [2023-11-19 04:51:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:51:45,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-19 04:51:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:45,045 INFO L225 Difference]: With dead ends: 185 [2023-11-19 04:51:45,045 INFO L226 Difference]: Without dead ends: 67 [2023-11-19 04:51:45,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:51:45,047 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:45,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:51:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-19 04:51:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-19 04:51:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.106060606060606) internal successors, (139), 66 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:45,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 139 transitions. [2023-11-19 04:51:45,060 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 139 transitions. Word has length 2 [2023-11-19 04:51:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:45,061 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 139 transitions. [2023-11-19 04:51:45,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 139 transitions. [2023-11-19 04:51:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:51:45,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:45,065 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-19 04:51:45,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:51:45,069 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:51:45,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash -465106768, now seen corresponding path program 1 times [2023-11-19 04:51:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387662934] [2023-11-19 04:51:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:45,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:51:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:45,198 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:51:45,199 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:51:45,199 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-19 04:51:45,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-19 04:51:45,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-19 04:51:45,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-19 04:51:45,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-19 04:51:45,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:51:45,212 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 04:51:45,212 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 04:51:45,212 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-19 04:51:45,241 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-19 04:51:45,250 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:51:45,250 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 116 transitions, 272 flow [2023-11-19 04:51:45,251 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 116 transitions, 272 flow [2023-11-19 04:51:45,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 116 transitions, 272 flow [2023-11-19 04:51:45,384 INFO L124 PetriNetUnfolderBase]: 43/787 cut-off events. [2023-11-19 04:51:45,385 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-19 04:51:45,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 787 events. 43/787 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2973 event pairs, 6 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 455. Up to 32 conditions per place. [2023-11-19 04:51:45,402 INFO L119 LiptonReduction]: Number of co-enabled transitions 3528 [2023-11-19 04:51:49,538 INFO L134 LiptonReduction]: Checked pairs total: 3609 [2023-11-19 04:51:49,539 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-11-19 04:51:49,540 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 26 transitions, 92 flow [2023-11-19 04:51:49,584 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 785 states, 715 states have (on average 2.662937062937063) internal successors, (1904), 784 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:49,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:51:49,586 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=LoopHeads, 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;@5dd255b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:51:49,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 04:51:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 785 states, 715 states have (on average 2.662937062937063) internal successors, (1904), 784 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 04:51:49,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:49,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 04:51:49,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:51:49,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash 31669, now seen corresponding path program 1 times [2023-11-19 04:51:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:49,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239735079] [2023-11-19 04:51:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:49,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239735079] [2023-11-19 04:51:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239735079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:49,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:49,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:51:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934560626] [2023-11-19 04:51:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:49,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:51:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:51:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:51:49,630 INFO L87 Difference]: Start difference. First operand has 785 states, 715 states have (on average 2.662937062937063) internal successors, (1904), 784 states have internal predecessors, (1904), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:49,701 INFO L93 Difference]: Finished difference Result 511 states and 1257 transitions. [2023-11-19 04:51:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:51:49,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-19 04:51:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:49,704 INFO L225 Difference]: With dead ends: 511 [2023-11-19 04:51:49,705 INFO L226 Difference]: Without dead ends: 139 [2023-11-19 04:51:49,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:51:49,706 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:49,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:51:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-19 04:51:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-11-19 04:51:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.5434782608695654) internal successors, (351), 138 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 351 transitions. [2023-11-19 04:51:49,724 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 351 transitions. Word has length 2 [2023-11-19 04:51:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:49,725 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 351 transitions. [2023-11-19 04:51:49,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:49,725 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 351 transitions. [2023-11-19 04:51:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:51:49,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:49,727 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:49,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:51:49,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:51:49,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1458360906, now seen corresponding path program 1 times [2023-11-19 04:51:49,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:49,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231825364] [2023-11-19 04:51:49,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:49,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:49,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:51:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:49,861 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:51:49,862 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:51:49,862 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-19 04:51:49,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-19 04:51:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-19 04:51:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-19 04:51:49,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-19 04:51:49,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:51:49,864 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 04:51:49,864 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 04:51:49,864 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-19 04:51:49,890 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-11-19 04:51:49,893 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:51:49,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 124 transitions, 303 flow [2023-11-19 04:51:49,894 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 124 transitions, 303 flow [2023-11-19 04:51:49,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 124 transitions, 303 flow [2023-11-19 04:51:50,256 INFO L124 PetriNetUnfolderBase]: 93/1471 cut-off events. [2023-11-19 04:51:50,256 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-11-19 04:51:50,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 1471 events. 93/1471 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7471 event pairs, 23 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 832. Up to 80 conditions per place. [2023-11-19 04:51:50,291 INFO L119 LiptonReduction]: Number of co-enabled transitions 4680 [2023-11-19 04:51:54,656 INFO L134 LiptonReduction]: Checked pairs total: 5035 [2023-11-19 04:51:54,656 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-11-19 04:51:54,657 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 29 transitions, 113 flow [2023-11-19 04:51:54,754 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2225 states, 2090 states have (on average 2.977511961722488) internal successors, (6223), 2224 states have internal predecessors, (6223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:54,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:51:54,756 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=LoopHeads, 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;@5dd255b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:51:54,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 04:51:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 2225 states, 2090 states have (on average 2.977511961722488) internal successors, (6223), 2224 states have internal predecessors, (6223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 04:51:54,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:54,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 04:51:54,765 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:51:54,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:54,766 INFO L85 PathProgramCache]: Analyzing trace with hash 39481, now seen corresponding path program 1 times [2023-11-19 04:51:54,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:54,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885329274] [2023-11-19 04:51:54,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:54,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:51:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:51:54,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:51:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885329274] [2023-11-19 04:51:54,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885329274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:51:54,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:51:54,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:51:54,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813521073] [2023-11-19 04:51:54,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:51:54,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:51:54,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:51:54,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:51:54,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:51:54,791 INFO L87 Difference]: Start difference. First operand has 2225 states, 2090 states have (on average 2.977511961722488) internal successors, (6223), 2224 states have internal predecessors, (6223), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:51:54,858 INFO L93 Difference]: Finished difference Result 1433 states and 4087 transitions. [2023-11-19 04:51:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:51:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-19 04:51:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:51:54,869 INFO L225 Difference]: With dead ends: 1433 [2023-11-19 04:51:54,870 INFO L226 Difference]: Without dead ends: 283 [2023-11-19 04:51:54,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:51:54,873 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:51:54,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:51:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-11-19 04:51:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2023-11-19 04:51:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 3.00354609929078) internal successors, (847), 282 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 847 transitions. [2023-11-19 04:51:54,957 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 847 transitions. Word has length 2 [2023-11-19 04:51:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:51:54,957 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 847 transitions. [2023-11-19 04:51:54,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:51:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 847 transitions. [2023-11-19 04:51:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 04:51:54,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:51:54,968 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:51:54,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:51:54,969 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:51:54,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:51:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash 308116456, now seen corresponding path program 1 times [2023-11-19 04:51:54,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:51:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532830557] [2023-11-19 04:51:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:51:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:51:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:55,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:51:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:51:55,134 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:51:55,137 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:51:55,138 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-19 04:51:55,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-19 04:51:55,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-19 04:51:55,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-19 04:51:55,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-19 04:51:55,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:51:55,139 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 04:51:55,140 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 04:51:55,140 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-11-19 04:51:55,173 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-19 04:51:55,175 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:51:55,175 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 132 transitions, 336 flow [2023-11-19 04:51:55,176 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 132 transitions, 336 flow [2023-11-19 04:51:55,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 132 transitions, 336 flow [2023-11-19 04:51:55,694 INFO L124 PetriNetUnfolderBase]: 207/2827 cut-off events. [2023-11-19 04:51:55,694 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2023-11-19 04:51:55,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3053 conditions, 2827 events. 207/2827 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 18800 event pairs, 72 based on Foata normal form. 0/2485 useless extension candidates. Maximal degree in co-relation 1570. Up to 192 conditions per place. [2023-11-19 04:51:55,735 INFO L119 LiptonReduction]: Number of co-enabled transitions 5940 [2023-11-19 04:52:00,771 INFO L134 LiptonReduction]: Checked pairs total: 6675 [2023-11-19 04:52:00,771 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-11-19 04:52:00,772 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 32 transitions, 136 flow [2023-11-19 04:52:01,074 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6401 states, 6137 states have (on average 3.3029167345608603) internal successors, (20270), 6400 states have internal predecessors, (20270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:52:01,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:52:01,083 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=LoopHeads, 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;@5dd255b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:52:01,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 04:52:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 6401 states, 6137 states have (on average 3.3029167345608603) internal successors, (20270), 6400 states have internal predecessors, (20270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:52:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 04:52:01,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:52:01,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 04:52:01,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:52:01,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:52:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash 47801, now seen corresponding path program 1 times [2023-11-19 04:52:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:52:01,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945491169] [2023-11-19 04:52:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:52:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:52:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:52:01,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:52:01,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945491169] [2023-11-19 04:52:01,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945491169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:52:01,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:52:01,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:52:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120069683] [2023-11-19 04:52:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:52:01,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:52:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:52:01,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:52:01,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:52:01,137 INFO L87 Difference]: Start difference. First operand has 6401 states, 6137 states have (on average 3.3029167345608603) internal successors, (20270), 6400 states have internal predecessors, (20270), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:52:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:52:01,273 INFO L93 Difference]: Finished difference Result 4087 states and 13261 transitions. [2023-11-19 04:52:01,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:52:01,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-19 04:52:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:52:01,284 INFO L225 Difference]: With dead ends: 4087 [2023-11-19 04:52:01,284 INFO L226 Difference]: Without dead ends: 571 [2023-11-19 04:52:01,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:52:01,288 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:52:01,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:52:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2023-11-19 04:52:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2023-11-19 04:52:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 3.4789473684210526) internal successors, (1983), 570 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:52:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1983 transitions. [2023-11-19 04:52:01,331 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1983 transitions. Word has length 2 [2023-11-19 04:52:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:52:01,331 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 1983 transitions. [2023-11-19 04:52:01,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:52:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1983 transitions. [2023-11-19 04:52:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-19 04:52:01,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:52:01,335 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:52:01,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:52:01,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:52:01,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:52:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash -494928661, now seen corresponding path program 1 times [2023-11-19 04:52:01,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:52:01,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365908788] [2023-11-19 04:52:01,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:01,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:52:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:52:01,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:52:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:52:01,494 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:52:01,498 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:52:01,498 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-19 04:52:01,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-19 04:52:01,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-19 04:52:01,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-19 04:52:01,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-19 04:52:01,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:52:01,499 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 04:52:01,501 WARN L233 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 04:52:01,502 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-11-19 04:52:01,527 INFO L144 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2023-11-19 04:52:01,530 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:52:01,530 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 140 transitions, 371 flow [2023-11-19 04:52:01,530 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 140 transitions, 371 flow [2023-11-19 04:52:01,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 140 transitions, 371 flow [2023-11-19 04:52:02,613 INFO L124 PetriNetUnfolderBase]: 465/5543 cut-off events. [2023-11-19 04:52:02,613 INFO L125 PetriNetUnfolderBase]: For 525/525 co-relation queries the response was YES. [2023-11-19 04:52:02,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6034 conditions, 5543 events. 465/5543 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 45451 event pairs, 201 based on Foata normal form. 0/4878 useless extension candidates. Maximal degree in co-relation 3045. Up to 448 conditions per place. [2023-11-19 04:52:02,696 INFO L119 LiptonReduction]: Number of co-enabled transitions 7308 [2023-11-19 04:52:07,201 INFO L134 LiptonReduction]: Checked pairs total: 8393 [2023-11-19 04:52:07,201 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-11-19 04:52:07,202 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 35 transitions, 161 flow [2023-11-19 04:52:08,291 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 18641 states, 18120 states have (on average 3.637141280353201) internal successors, (65905), 18640 states have internal predecessors, (65905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:52:08,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:52:08,296 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=LoopHeads, 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;@5dd255b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:52:08,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 04:52:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 18641 states, 18120 states have (on average 3.637141280353201) internal successors, (65905), 18640 states have internal predecessors, (65905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:52:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 04:52:08,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:52:08,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 04:52:08,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:52:08,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:52:08,411 INFO L85 PathProgramCache]: Analyzing trace with hash 56277, now seen corresponding path program 1 times [2023-11-19 04:52:08,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:52:08,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758216993] [2023-11-19 04:52:08,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:52:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:52:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:52:08,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:52:08,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758216993] [2023-11-19 04:52:08,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758216993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:52:08,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:52:08,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:52:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888377639] [2023-11-19 04:52:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:52:08,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:52:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:52:08,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:52:08,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:52:08,461 INFO L87 Difference]: Start difference. First operand has 18641 states, 18120 states have (on average 3.637141280353201) internal successors, (65905), 18640 states have internal predecessors, (65905), 0 states have call successors, (0), 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 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:52:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:52:08,777 INFO L93 Difference]: Finished difference Result 11825 states and 43011 transitions. [2023-11-19 04:52:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:52:08,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-19 04:52:08,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:52:08,794 INFO L225 Difference]: With dead ends: 11825 [2023-11-19 04:52:08,795 INFO L226 Difference]: Without dead ends: 1147 [2023-11-19 04:52:08,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:52:08,796 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:52:08,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:52:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2023-11-19 04:52:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2023-11-19 04:52:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1146 states have (on average 3.9642233856893543) internal successors, (4543), 1146 states have internal predecessors, (4543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:52:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 4543 transitions. [2023-11-19 04:52:08,985 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 4543 transitions. Word has length 2 [2023-11-19 04:52:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:52:08,986 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 4543 transitions. [2023-11-19 04:52:08,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:52:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 4543 transitions. [2023-11-19 04:52:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 04:52:08,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:52:08,991 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:52:08,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 04:52:08,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-19 04:52:08,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:52:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash -570383867, now seen corresponding path program 1 times [2023-11-19 04:52:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:52:08,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89888288] [2023-11-19 04:52:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:08,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:52:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:52:09,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:52:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:52:09,162 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:52:09,163 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:52:09,163 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-19 04:52:09,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-19 04:52:09,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-19 04:52:09,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-19 04:52:09,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-19 04:52:09,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 04:52:09,165 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 04:52:09,166 WARN L233 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 04:52:09,166 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2023-11-19 04:52:09,202 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-11-19 04:52:09,205 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:52:09,206 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 148 transitions, 408 flow [2023-11-19 04:52:09,206 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 148 transitions, 408 flow [2023-11-19 04:52:09,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 148 transitions, 408 flow [2023-11-19 04:52:12,121 INFO L124 PetriNetUnfolderBase]: 1043/11011 cut-off events. [2023-11-19 04:52:12,122 INFO L125 PetriNetUnfolderBase]: For 1136/1136 co-relation queries the response was YES. [2023-11-19 04:52:12,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12088 conditions, 11011 events. 1043/11011 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 108235 event pairs, 522 based on Foata normal form. 0/9703 useless extension candidates. Maximal degree in co-relation 6025. Up to 1024 conditions per place. [2023-11-19 04:52:12,354 INFO L119 LiptonReduction]: Number of co-enabled transitions 8784