./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje --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 b606ed8b0061f7540a480987fb5d0368be6ab145ef928bee0cc134c3bece9590 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:20:24,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:20:24,488 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DataRace-32bit-Taipan_Default.epf [2024-11-09 05:20:24,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:20:24,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:20:24,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:20:24,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:20:24,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:20:24,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:20:24,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:20:24,526 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:20:24,526 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:20:24,527 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:20:24,527 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:20:24,527 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:20:24,528 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:20:24,528 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:20:24,528 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:20:24,529 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:20:24,529 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:20:24,530 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:20:24,530 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:20:24,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:20:24,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:20:24,532 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:20:24,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:20:24,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:20:24,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:20:24,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:20:24,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:20:24,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:20:24,550 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 05:20:24,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:20:24,550 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:20:24,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:20:24,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:20:24,551 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:20:24,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:20:24,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:20:24,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:20:24,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:20:24,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:20:24,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:20:24,557 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:20:24,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:20:24,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:20:24,558 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:20:24,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:20:24,558 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_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/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_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje 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 -> b606ed8b0061f7540a480987fb5d0368be6ab145ef928bee0cc134c3bece9590 [2024-11-09 05:20:24,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:20:24,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:20:24,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:20:24,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:20:24,911 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:20:24,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i Unable to find full path for "g++" [2024-11-09 05:20:26,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:20:27,383 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:20:27,384 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i [2024-11-09 05:20:27,403 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/data/c84acf246/991148f61188417dbcf5cfde4aa32eba/FLAG26cc0278c [2024-11-09 05:20:27,432 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/data/c84acf246/991148f61188417dbcf5cfde4aa32eba [2024-11-09 05:20:27,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:20:27,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:20:27,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:20:27,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:20:27,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:20:27,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:20:27" (1/1) ... [2024-11-09 05:20:27,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4da62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:27, skipping insertion in model container [2024-11-09 05:20:27,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:20:27" (1/1) ... [2024-11-09 05:20:27,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:20:28,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:20:28,304 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:20:28,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:20:28,477 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:20:28,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28 WrapperNode [2024-11-09 05:20:28,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:20:28,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:20:28,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:20:28,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:20:28,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,555 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-09 05:20:28,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:20:28,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:20:28,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:20:28,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:20:28,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:20:28,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:20:28,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:20:28,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:20:28,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (1/1) ... [2024-11-09 05:20:28,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:20:28,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:20:28,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:20:28,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:20:28,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:20:28,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:20:28,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:20:28,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:20:28,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-09 05:20:28,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-09 05:20:28,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:20:28,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:20:28,714 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 05:20:28,933 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:20:28,935 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:20:29,300 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 05:20:29,300 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:20:29,325 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:20:29,325 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:20:29,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:20:29 BoogieIcfgContainer [2024-11-09 05:20:29,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:20:29,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:20:29,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:20:29,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:20:29,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:20:27" (1/3) ... [2024-11-09 05:20:29,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720bee88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:20:29, skipping insertion in model container [2024-11-09 05:20:29,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:20:28" (2/3) ... [2024-11-09 05:20:29,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720bee88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:20:29, skipping insertion in model container [2024-11-09 05:20:29,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:20:29" (3/3) ... [2024-11-09 05:20:29,340 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race-2.i [2024-11-09 05:20:29,365 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:20:29,365 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 05:20:29,366 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 05:20:29,465 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 05:20:29,510 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 98 transitions, 203 flow [2024-11-09 05:20:29,660 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 922 states, 900 states have (on average 1.958888888888889) internal successors, (1763), 921 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:29,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:20:29,717 INFO L333 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, 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;@4002c8c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:20:29,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 05:20:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 922 states, 900 states have (on average 1.958888888888889) internal successors, (1763), 921 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 05:20:29,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:29,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:29,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 05:20:29,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash -945930089, now seen corresponding path program 1 times [2024-11-09 05:20:29,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:29,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077540803] [2024-11-09 05:20:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:30,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:30,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077540803] [2024-11-09 05:20:30,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077540803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:20:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476102836] [2024-11-09 05:20:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:30,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:20:30,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:30,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:20:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:30,171 INFO L87 Difference]: Start difference. First operand has 922 states, 900 states have (on average 1.958888888888889) internal successors, (1763), 921 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:30,297 INFO L93 Difference]: Finished difference Result 1829 states and 3511 transitions. [2024-11-09 05:20:30,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:20:30,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 05:20:30,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:30,323 INFO L225 Difference]: With dead ends: 1829 [2024-11-09 05:20:30,323 INFO L226 Difference]: Without dead ends: 889 [2024-11-09 05:20:30,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:30,336 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:30,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 174 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:20:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-09 05:20:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2024-11-09 05:20:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 870 states have (on average 1.952873563218391) internal successors, (1699), 888 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1699 transitions. [2024-11-09 05:20:30,499 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1699 transitions. Word has length 23 [2024-11-09 05:20:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:30,500 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1699 transitions. [2024-11-09 05:20:30,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1699 transitions. [2024-11-09 05:20:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:20:30,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:30,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:30,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:20:30,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 05:20:30,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:30,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1289992362, now seen corresponding path program 1 times [2024-11-09 05:20:30,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:30,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379080297] [2024-11-09 05:20:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:30,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:30,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379080297] [2024-11-09 05:20:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379080297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:30,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:30,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:20:30,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037582008] [2024-11-09 05:20:30,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:30,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:20:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:30,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:20:30,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:30,696 INFO L87 Difference]: Start difference. First operand 889 states and 1699 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:30,745 INFO L93 Difference]: Finished difference Result 901 states and 1712 transitions. [2024-11-09 05:20:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:20:30,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 05:20:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:30,755 INFO L225 Difference]: With dead ends: 901 [2024-11-09 05:20:30,755 INFO L226 Difference]: Without dead ends: 811 [2024-11-09 05:20:30,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:30,758 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:30,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 191 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:20:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-09 05:20:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 802. [2024-11-09 05:20:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 792 states have (on average 1.9242424242424243) internal successors, (1524), 801 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1524 transitions. [2024-11-09 05:20:30,830 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1524 transitions. Word has length 34 [2024-11-09 05:20:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:30,832 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1524 transitions. [2024-11-09 05:20:30,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1524 transitions. [2024-11-09 05:20:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 05:20:30,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:30,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:30,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:20:30,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 05:20:30,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1601060993, now seen corresponding path program 1 times [2024-11-09 05:20:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:30,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408809886] [2024-11-09 05:20:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:30,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:31,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408809886] [2024-11-09 05:20:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408809886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:31,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:31,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:20:31,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442073011] [2024-11-09 05:20:31,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:31,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:20:31,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:31,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:20:31,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:20:31,246 INFO L87 Difference]: Start difference. First operand 802 states and 1524 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:31,432 INFO L93 Difference]: Finished difference Result 811 states and 1532 transitions. [2024-11-09 05:20:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:20:31,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 05:20:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:31,443 INFO L225 Difference]: With dead ends: 811 [2024-11-09 05:20:31,443 INFO L226 Difference]: Without dead ends: 800 [2024-11-09 05:20:31,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:31,449 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:31,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 220 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:20:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-09 05:20:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2024-11-09 05:20:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 790 states have (on average 1.9240506329113924) internal successors, (1520), 799 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1520 transitions. [2024-11-09 05:20:31,500 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1520 transitions. Word has length 37 [2024-11-09 05:20:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:31,502 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1520 transitions. [2024-11-09 05:20:31,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1520 transitions. [2024-11-09 05:20:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 05:20:31,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:31,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:31,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:20:31,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 05:20:31,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -836465057, now seen corresponding path program 1 times [2024-11-09 05:20:31,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:31,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696893507] [2024-11-09 05:20:31,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:31,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:32,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:32,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696893507] [2024-11-09 05:20:32,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696893507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:32,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:20:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096900347] [2024-11-09 05:20:32,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:32,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:20:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:20:32,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:32,337 INFO L87 Difference]: Start difference. First operand 800 states and 1520 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:32,663 INFO L93 Difference]: Finished difference Result 870 states and 1643 transitions. [2024-11-09 05:20:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:20:32,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 05:20:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:32,670 INFO L225 Difference]: With dead ends: 870 [2024-11-09 05:20:32,670 INFO L226 Difference]: Without dead ends: 850 [2024-11-09 05:20:32,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:32,676 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 72 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:32,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 321 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:20:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-09 05:20:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 830. [2024-11-09 05:20:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 821 states have (on average 1.920828258221681) internal successors, (1577), 829 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1577 transitions. [2024-11-09 05:20:32,715 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1577 transitions. Word has length 37 [2024-11-09 05:20:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:32,716 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1577 transitions. [2024-11-09 05:20:32,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1577 transitions. [2024-11-09 05:20:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 05:20:32,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:32,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:32,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:20:32,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 05:20:32,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash 281188658, now seen corresponding path program 1 times [2024-11-09 05:20:32,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:32,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109027650] [2024-11-09 05:20:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:33,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109027650] [2024-11-09 05:20:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109027650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:33,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:33,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:20:33,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753931723] [2024-11-09 05:20:33,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:33,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:20:33,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:33,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:20:33,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:33,398 INFO L87 Difference]: Start difference. First operand 830 states and 1577 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 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) [2024-11-09 05:20:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:33,819 INFO L93 Difference]: Finished difference Result 930 states and 1759 transitions. [2024-11-09 05:20:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:20:33,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 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) Word has length 51 [2024-11-09 05:20:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:33,830 INFO L225 Difference]: With dead ends: 930 [2024-11-09 05:20:33,830 INFO L226 Difference]: Without dead ends: 754 [2024-11-09 05:20:33,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:33,836 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 144 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:33,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 524 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:20:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-09 05:20:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 722. [2024-11-09 05:20:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 714 states have (on average 1.8865546218487395) internal successors, (1347), 721 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1347 transitions. [2024-11-09 05:20:33,873 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1347 transitions. Word has length 51 [2024-11-09 05:20:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:33,875 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1347 transitions. [2024-11-09 05:20:33,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 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) [2024-11-09 05:20:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1347 transitions. [2024-11-09 05:20:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 05:20:33,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:33,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:33,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:20:33,884 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 05:20:33,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash -774464824, now seen corresponding path program 1 times [2024-11-09 05:20:33,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:33,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976367801] [2024-11-09 05:20:33,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:33,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:20:34,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:34,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976367801] [2024-11-09 05:20:34,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976367801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:34,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:34,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:20:34,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167111611] [2024-11-09 05:20:34,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:34,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:20:34,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:34,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:20:34,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:34,424 INFO L87 Difference]: Start difference. First operand 722 states and 1347 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:34,706 INFO L93 Difference]: Finished difference Result 791 states and 1460 transitions. [2024-11-09 05:20:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:20:34,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 05:20:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:34,712 INFO L225 Difference]: With dead ends: 791 [2024-11-09 05:20:34,712 INFO L226 Difference]: Without dead ends: 675 [2024-11-09 05:20:34,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:34,719 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 64 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:34,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 332 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:20:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-09 05:20:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 671. [2024-11-09 05:20:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 664 states have (on average 1.8734939759036144) internal successors, (1244), 670 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1244 transitions. [2024-11-09 05:20:34,749 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1244 transitions. Word has length 55 [2024-11-09 05:20:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:34,750 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 1244 transitions. [2024-11-09 05:20:34,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1244 transitions. [2024-11-09 05:20:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 05:20:34,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:34,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:34,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:20:34,754 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 05:20:34,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash -305935262, now seen corresponding path program 1 times [2024-11-09 05:20:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258663694] [2024-11-09 05:20:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:34,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:20:34,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:20:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:20:34,853 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 05:20:34,854 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:20:34,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-09 05:20:34,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-09 05:20:34,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-09 05:20:34,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-09 05:20:34,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-09 05:20:34,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-09 05:20:34,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-09 05:20:34,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-09 05:20:34,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-09 05:20:34,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:20:34,862 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:34,864 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 05:20:34,865 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 05:20:34,899 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 05:20:34,905 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 119 transitions, 254 flow [2024-11-09 05:20:35,724 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 18682 states, 18603 states have (on average 2.859538784067086) internal successors, (53196), 18681 states have internal predecessors, (53196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:35,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:20:35,726 INFO L333 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, 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;@4002c8c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:20:35,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-09 05:20:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 18682 states, 18603 states have (on average 2.859538784067086) internal successors, (53196), 18681 states have internal predecessors, (53196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 05:20:35,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:35,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:35,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:20:35,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1078925678, now seen corresponding path program 1 times [2024-11-09 05:20:35,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:35,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550102692] [2024-11-09 05:20:35,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:35,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:35,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550102692] [2024-11-09 05:20:35,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550102692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:35,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:20:35,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104913758] [2024-11-09 05:20:35,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:35,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:20:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:35,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:20:35,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:35,837 INFO L87 Difference]: Start difference. First operand has 18682 states, 18603 states have (on average 2.859538784067086) internal successors, (53196), 18681 states have internal predecessors, (53196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:36,611 INFO L93 Difference]: Finished difference Result 37349 states and 106377 transitions. [2024-11-09 05:20:36,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:20:36,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 05:20:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:36,801 INFO L225 Difference]: With dead ends: 37349 [2024-11-09 05:20:36,801 INFO L226 Difference]: Without dead ends: 18469 [2024-11-09 05:20:36,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:36,951 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 209 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 [2024-11-09 05:20:36,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 209 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:20:36,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states. [2024-11-09 05:20:37,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 18469. [2024-11-09 05:20:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18469 states, 18395 states have (on average 2.860668659961946) internal successors, (52622), 18468 states have internal predecessors, (52622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 52622 transitions. [2024-11-09 05:20:37,814 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 52622 transitions. Word has length 23 [2024-11-09 05:20:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:37,814 INFO L471 AbstractCegarLoop]: Abstraction has 18469 states and 52622 transitions. [2024-11-09 05:20:37,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 52622 transitions. [2024-11-09 05:20:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:20:37,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:37,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:37,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:20:37,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:20:37,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1460698058, now seen corresponding path program 1 times [2024-11-09 05:20:37,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:37,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392012854] [2024-11-09 05:20:37,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:37,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:37,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392012854] [2024-11-09 05:20:37,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392012854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:37,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:37,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:20:37,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672466167] [2024-11-09 05:20:37,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:37,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:20:37,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:20:37,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:37,856 INFO L87 Difference]: Start difference. First operand 18469 states and 52622 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:38,290 INFO L93 Difference]: Finished difference Result 18520 states and 52716 transitions. [2024-11-09 05:20:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:20:38,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 05:20:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:38,426 INFO L225 Difference]: With dead ends: 18520 [2024-11-09 05:20:38,427 INFO L226 Difference]: Without dead ends: 16225 [2024-11-09 05:20:38,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:20:38,443 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 83 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:38,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 213 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:20:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16225 states. [2024-11-09 05:20:39,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16225 to 16177. [2024-11-09 05:20:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16177 states, 16149 states have (on average 2.8455012694284476) internal successors, (45952), 16176 states have internal predecessors, (45952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16177 states to 16177 states and 45952 transitions. [2024-11-09 05:20:39,239 INFO L78 Accepts]: Start accepts. Automaton has 16177 states and 45952 transitions. Word has length 34 [2024-11-09 05:20:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:39,239 INFO L471 AbstractCegarLoop]: Abstraction has 16177 states and 45952 transitions. [2024-11-09 05:20:39,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 16177 states and 45952 transitions. [2024-11-09 05:20:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 05:20:39,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:39,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:39,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:20:39,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:20:39,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1853053898, now seen corresponding path program 1 times [2024-11-09 05:20:39,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:39,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063263417] [2024-11-09 05:20:39,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:39,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:39,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:39,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063263417] [2024-11-09 05:20:39,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063263417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:39,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:39,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:20:39,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449888549] [2024-11-09 05:20:39,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:39,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:20:39,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:39,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:20:39,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:20:39,342 INFO L87 Difference]: Start difference. First operand 16177 states and 45952 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:39,833 INFO L93 Difference]: Finished difference Result 16186 states and 45960 transitions. [2024-11-09 05:20:39,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:20:39,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 05:20:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:40,139 INFO L225 Difference]: With dead ends: 16186 [2024-11-09 05:20:40,140 INFO L226 Difference]: Without dead ends: 16175 [2024-11-09 05:20:40,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:40,149 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 37 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:40,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 352 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:20:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16175 states. [2024-11-09 05:20:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16175 to 16175. [2024-11-09 05:20:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16175 states, 16147 states have (on average 2.8456059949216574) internal successors, (45948), 16174 states have internal predecessors, (45948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16175 states to 16175 states and 45948 transitions. [2024-11-09 05:20:40,909 INFO L78 Accepts]: Start accepts. Automaton has 16175 states and 45948 transitions. Word has length 37 [2024-11-09 05:20:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:40,910 INFO L471 AbstractCegarLoop]: Abstraction has 16175 states and 45948 transitions. [2024-11-09 05:20:40,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 16175 states and 45948 transitions. [2024-11-09 05:20:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 05:20:40,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:40,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:40,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:20:40,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:20:40,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1088457962, now seen corresponding path program 1 times [2024-11-09 05:20:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:40,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740390930] [2024-11-09 05:20:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:41,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:41,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740390930] [2024-11-09 05:20:41,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740390930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:41,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:41,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:20:41,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023649153] [2024-11-09 05:20:41,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:41,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:20:41,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:41,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:20:41,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:41,466 INFO L87 Difference]: Start difference. First operand 16175 states and 45948 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:42,026 INFO L93 Difference]: Finished difference Result 18375 states and 51918 transitions. [2024-11-09 05:20:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:20:42,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 05:20:42,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:42,133 INFO L225 Difference]: With dead ends: 18375 [2024-11-09 05:20:42,133 INFO L226 Difference]: Without dead ends: 17994 [2024-11-09 05:20:42,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:42,146 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 159 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:42,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 345 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:20:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17994 states. [2024-11-09 05:20:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17994 to 17244. [2024-11-09 05:20:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17244 states, 17217 states have (on average 2.844281814485683) internal successors, (48970), 17243 states have internal predecessors, (48970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17244 states to 17244 states and 48970 transitions. [2024-11-09 05:20:42,910 INFO L78 Accepts]: Start accepts. Automaton has 17244 states and 48970 transitions. Word has length 37 [2024-11-09 05:20:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:42,911 INFO L471 AbstractCegarLoop]: Abstraction has 17244 states and 48970 transitions. [2024-11-09 05:20:42,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 17244 states and 48970 transitions. [2024-11-09 05:20:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 05:20:42,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:42,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:42,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:20:42,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:20:42,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash 25901206, now seen corresponding path program 1 times [2024-11-09 05:20:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:42,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050074367] [2024-11-09 05:20:42,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:42,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:20:43,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050074367] [2024-11-09 05:20:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050074367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:43,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:43,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:20:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510450268] [2024-11-09 05:20:43,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:43,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:20:43,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:43,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:20:43,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:43,532 INFO L87 Difference]: Start difference. First operand 17244 states and 48970 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 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) [2024-11-09 05:20:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:44,386 INFO L93 Difference]: Finished difference Result 28164 states and 80309 transitions. [2024-11-09 05:20:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:20:44,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 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) Word has length 51 [2024-11-09 05:20:44,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:44,544 INFO L225 Difference]: With dead ends: 28164 [2024-11-09 05:20:44,545 INFO L226 Difference]: Without dead ends: 26461 [2024-11-09 05:20:44,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:44,563 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 230 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:44,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 699 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:20:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26461 states. [2024-11-09 05:20:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26461 to 19751. [2024-11-09 05:20:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19751 states, 19724 states have (on average 2.8568748732508618) internal successors, (56349), 19750 states have internal predecessors, (56349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19751 states to 19751 states and 56349 transitions. [2024-11-09 05:20:45,607 INFO L78 Accepts]: Start accepts. Automaton has 19751 states and 56349 transitions. Word has length 51 [2024-11-09 05:20:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:45,608 INFO L471 AbstractCegarLoop]: Abstraction has 19751 states and 56349 transitions. [2024-11-09 05:20:45,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 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) [2024-11-09 05:20:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 19751 states and 56349 transitions. [2024-11-09 05:20:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 05:20:45,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:45,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:45,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:20:45,610 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:20:45,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash -453980692, now seen corresponding path program 1 times [2024-11-09 05:20:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:45,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005266120] [2024-11-09 05:20:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:20:46,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:46,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005266120] [2024-11-09 05:20:46,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005266120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:46,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:46,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:20:46,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853690187] [2024-11-09 05:20:46,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:46,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:20:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:46,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:20:46,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:46,124 INFO L87 Difference]: Start difference. First operand 19751 states and 56349 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:47,130 INFO L93 Difference]: Finished difference Result 21820 states and 61638 transitions. [2024-11-09 05:20:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:20:47,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 05:20:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:47,291 INFO L225 Difference]: With dead ends: 21820 [2024-11-09 05:20:47,292 INFO L226 Difference]: Without dead ends: 20828 [2024-11-09 05:20:47,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:20:47,305 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 117 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:47,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 532 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:20:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20828 states. [2024-11-09 05:20:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20828 to 20401. [2024-11-09 05:20:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20401 states, 20375 states have (on average 2.853644171779141) internal successors, (58143), 20400 states have internal predecessors, (58143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20401 states to 20401 states and 58143 transitions. [2024-11-09 05:20:48,283 INFO L78 Accepts]: Start accepts. Automaton has 20401 states and 58143 transitions. Word has length 55 [2024-11-09 05:20:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:48,284 INFO L471 AbstractCegarLoop]: Abstraction has 20401 states and 58143 transitions. [2024-11-09 05:20:48,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 20401 states and 58143 transitions. [2024-11-09 05:20:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 05:20:48,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:48,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:48,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:20:48,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:20:48,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash 795914643, now seen corresponding path program 1 times [2024-11-09 05:20:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436267799] [2024-11-09 05:20:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:48,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:20:49,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436267799] [2024-11-09 05:20:49,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436267799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:49,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:49,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:20:49,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528211187] [2024-11-09 05:20:49,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:49,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:20:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:49,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:20:49,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:20:49,198 INFO L87 Difference]: Start difference. First operand 20401 states and 58143 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:50,246 INFO L93 Difference]: Finished difference Result 20401 states and 58143 transitions. [2024-11-09 05:20:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:20:50,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 05:20:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:50,390 INFO L225 Difference]: With dead ends: 20401 [2024-11-09 05:20:50,390 INFO L226 Difference]: Without dead ends: 19868 [2024-11-09 05:20:50,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:20:50,407 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 297 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:50,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 838 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:20:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19868 states. [2024-11-09 05:20:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19868 to 18818. [2024-11-09 05:20:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18818 states, 18800 states have (on average 2.8579787234042553) internal successors, (53730), 18817 states have internal predecessors, (53730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18818 states to 18818 states and 53730 transitions. [2024-11-09 05:20:51,240 INFO L78 Accepts]: Start accepts. Automaton has 18818 states and 53730 transitions. Word has length 64 [2024-11-09 05:20:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:51,241 INFO L471 AbstractCegarLoop]: Abstraction has 18818 states and 53730 transitions. [2024-11-09 05:20:51,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 18818 states and 53730 transitions. [2024-11-09 05:20:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 05:20:51,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:51,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:51,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 05:20:51,245 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:20:51,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:51,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1822280579, now seen corresponding path program 1 times [2024-11-09 05:20:51,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:51,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422463513] [2024-11-09 05:20:51,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:20:52,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422463513] [2024-11-09 05:20:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422463513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:20:52,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:20:52,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:20:52,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093920821] [2024-11-09 05:20:52,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:20:52,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:20:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:20:52,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:20:52,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:20:52,092 INFO L87 Difference]: Start difference. First operand 18818 states and 53730 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:20:53,731 INFO L93 Difference]: Finished difference Result 25635 states and 72429 transitions. [2024-11-09 05:20:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 05:20:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 05:20:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:20:53,860 INFO L225 Difference]: With dead ends: 25635 [2024-11-09 05:20:53,860 INFO L226 Difference]: Without dead ends: 24334 [2024-11-09 05:20:53,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:20:53,876 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 477 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:20:53,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1318 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 05:20:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24334 states. [2024-11-09 05:20:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24334 to 17455. [2024-11-09 05:20:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17455 states, 17438 states have (on average 2.8535955958252095) internal successors, (49761), 17454 states have internal predecessors, (49761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17455 states to 17455 states and 49761 transitions. [2024-11-09 05:20:54,962 INFO L78 Accepts]: Start accepts. Automaton has 17455 states and 49761 transitions. Word has length 64 [2024-11-09 05:20:54,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:20:54,963 INFO L471 AbstractCegarLoop]: Abstraction has 17455 states and 49761 transitions. [2024-11-09 05:20:54,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:20:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 17455 states and 49761 transitions. [2024-11-09 05:20:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 05:20:54,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:20:54,966 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:20:54,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 05:20:54,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:20:54,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:20:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1076657401, now seen corresponding path program 1 times [2024-11-09 05:20:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:20:54,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800046255] [2024-11-09 05:20:54,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:20:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:20:55,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:20:55,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800046255] [2024-11-09 05:20:55,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800046255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:20:55,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293825512] [2024-11-09 05:20:55,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:20:55,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:20:55,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:20:55,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:20:55,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:20:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:20:55,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 05:20:56,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:20:56,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:20:56,171 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:20:56,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 05:20:56,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 05:20:56,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-09 05:20:56,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:20:56,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-09 05:20:56,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:20:56,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-09 05:20:56,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-09 05:20:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:20:56,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:20:59,224 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_302) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_302) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_302) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_302) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-09 05:20:59,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_302) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_302) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_302) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_302) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-09 05:21:01,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:21:01,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-09 05:21:01,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:21:01,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 35 [2024-11-09 05:21:01,408 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 05:21:01,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-09 05:21:01,416 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 05:21:01,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 05:21:01,429 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 05:21:01,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-09 05:21:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 7 trivial. 2 not checked. [2024-11-09 05:21:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293825512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:21:01,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1137301364] [2024-11-09 05:21:01,542 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:21:01,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:21:01,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-09 05:21:01,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978539769] [2024-11-09 05:21:01,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:21:01,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 05:21:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:01,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 05:21:01,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=152, Unknown=17, NotChecked=54, Total=272 [2024-11-09 05:21:01,548 INFO L87 Difference]: Start difference. First operand 17455 states and 49761 transitions. Second operand has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:21:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:02,832 INFO L93 Difference]: Finished difference Result 17455 states and 49761 transitions. [2024-11-09 05:21:02,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:21:02,833 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 05:21:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:02,922 INFO L225 Difference]: With dead ends: 17455 [2024-11-09 05:21:02,923 INFO L226 Difference]: Without dead ends: 17135 [2024-11-09 05:21:02,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=119, Invalid=378, Unknown=17, NotChecked=86, Total=600 [2024-11-09 05:21:02,933 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 359 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 578 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:02,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 921 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 517 Invalid, 0 Unknown, 578 Unchecked, 0.7s Time] [2024-11-09 05:21:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17135 states. [2024-11-09 05:21:03,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17135 to 15855. [2024-11-09 05:21:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15855 states, 15843 states have (on average 2.854131162027394) internal successors, (45218), 15854 states have internal predecessors, (45218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:21:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15855 states to 15855 states and 45218 transitions. [2024-11-09 05:21:03,638 INFO L78 Accepts]: Start accepts. Automaton has 15855 states and 45218 transitions. Word has length 64 [2024-11-09 05:21:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:03,639 INFO L471 AbstractCegarLoop]: Abstraction has 15855 states and 45218 transitions. [2024-11-09 05:21:03,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:21:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 15855 states and 45218 transitions. [2024-11-09 05:21:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 05:21:03,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:03,643 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:03,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:21:03,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecf7a24f-edcb-45e2-958e-1eed7e847109/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 05:21:03,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:21:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1215948994, now seen corresponding path program 1 times [2024-11-09 05:21:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:03,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282361075] [2024-11-09 05:21:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:21:04,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:04,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282361075] [2024-11-09 05:21:04,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282361075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:04,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:04,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:21:04,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053203463] [2024-11-09 05:21:04,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:04,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:21:04,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:04,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:21:04,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:21:04,344 INFO L87 Difference]: Start difference. First operand 15855 states and 45218 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:21:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:05,527 INFO L93 Difference]: Finished difference Result 23750 states and 66985 transitions. [2024-11-09 05:21:05,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:21:05,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-09 05:21:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:05,645 INFO L225 Difference]: With dead ends: 23750 [2024-11-09 05:21:05,645 INFO L226 Difference]: Without dead ends: 22001 [2024-11-09 05:21:05,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:21:05,660 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 216 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:05,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 743 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:21:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22001 states. [2024-11-09 05:21:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22001 to 16615. [2024-11-09 05:21:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16615 states, 16603 states have (on average 2.83948683972776) internal successors, (47144), 16614 states have internal predecessors, (47144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:21:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16615 states to 16615 states and 47144 transitions. [2024-11-09 05:21:06,346 INFO L78 Accepts]: Start accepts. Automaton has 16615 states and 47144 transitions. Word has length 69 [2024-11-09 05:21:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:06,347 INFO L471 AbstractCegarLoop]: Abstraction has 16615 states and 47144 transitions. [2024-11-09 05:21:06,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:21:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 16615 states and 47144 transitions. [2024-11-09 05:21:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 05:21:06,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:06,355 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:21:06,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 05:21:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash 773455507, now seen corresponding path program 1 times [2024-11-09 05:21:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:06,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645265397] [2024-11-09 05:21:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:21:06,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:21:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:21:06,415 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 05:21:06,415 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:21:06,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-09 05:21:06,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-09 05:21:06,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-09 05:21:06,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-09 05:21:06,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-09 05:21:06,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-09 05:21:06,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-09 05:21:06,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-09 05:21:06,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-09 05:21:06,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-09 05:21:06,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-09 05:21:06,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 05:21:06,419 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:06,420 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 05:21:06,420 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 05:21:06,455 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 05:21:06,460 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 140 transitions, 307 flow [2024-11-09 05:21:17,839 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 384382 states, 384096 states have (on average 3.7744001499625095) internal successors, (1449732), 384381 states have internal predecessors, (1449732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:21:17,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:21:17,846 INFO L333 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, 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;@4002c8c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:21:17,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-09 05:21:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 384382 states, 384096 states have (on average 3.7744001499625095) internal successors, (1449732), 384381 states have internal predecessors, (1449732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:21:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 05:21:18,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:18,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:18,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-09 05:21:18,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2097084038, now seen corresponding path program 1 times [2024-11-09 05:21:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:18,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117328713] [2024-11-09 05:21:18,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:21:18,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:18,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117328713] [2024-11-09 05:21:18,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117328713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:18,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:18,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:21:18,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204094452] [2024-11-09 05:21:18,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:18,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:21:18,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:18,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:21:18,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:21:18,856 INFO L87 Difference]: Start difference. First operand has 384382 states, 384096 states have (on average 3.7744001499625095) internal successors, (1449732), 384381 states have internal predecessors, (1449732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)