./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91 --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 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:54:24,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:54:24,522 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-24 23:54:24,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:54:24,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:54:24,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:54:24,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:54:24,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:54:24,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:54:24,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:54:24,581 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:54:24,581 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:54:24,582 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:54:24,584 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:54:24,584 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:54:24,584 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:54:24,585 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:54:24,585 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:54:24,586 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:54:24,586 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:54:24,587 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:54:24,587 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:54:24,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:54:24,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:54:24,589 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:54:24,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:54:24,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:54:24,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:54:24,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:54:24,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:54:24,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:54:24,593 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 23:54:24,594 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:54:24,594 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:54:24,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:54:24,594 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:54:24,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:54:24,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:54:24,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:54:24,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:54:24,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:54:24,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:54:24,596 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:54:24,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:54:24,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:54:24,597 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:54:24,598 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:54:24,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:54:24,598 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_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/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_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91 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 -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f [2023-11-24 23:54:24,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:54:24,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:54:24,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:54:24,947 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:54:24,948 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:54:24,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2023-11-24 23:54:28,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:54:28,439 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:54:28,439 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2023-11-24 23:54:28,467 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/data/5f9ea72ef/e426a6a81f0349f79458e35ef743316f/FLAG020d137fb [2023-11-24 23:54:28,482 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/data/5f9ea72ef/e426a6a81f0349f79458e35ef743316f [2023-11-24 23:54:28,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:54:28,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:54:28,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:54:28,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:54:28,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:54:28,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:54:28" (1/1) ... [2023-11-24 23:54:28,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f3cb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:28, skipping insertion in model container [2023-11-24 23:54:28,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:54:28" (1/1) ... [2023-11-24 23:54:28,554 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:54:29,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:54:29,154 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:54:29,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:54:29,308 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:54:29,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29 WrapperNode [2023-11-24 23:54:29,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:54:29,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:54:29,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:54:29,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:54:29,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,384 INFO L138 Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-24 23:54:29,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:54:29,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:54:29,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:54:29,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:54:29,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:54:29,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:54:29,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:54:29,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:54:29,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (1/1) ... [2023-11-24 23:54:29,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:54:29,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:29,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:54:29,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:54:29,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 23:54:29,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:54:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:54:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 23:54:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 23:54:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:54:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:54:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-24 23:54:29,523 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-24 23:54:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:54:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:54:29,525 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 23:54:29,683 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:54:29,685 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:54:30,013 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:54:30,025 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:54:30,025 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 23:54:30,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:54:30 BoogieIcfgContainer [2023-11-24 23:54:30,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:54:30,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:54:30,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:54:30,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:54:30,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:54:28" (1/3) ... [2023-11-24 23:54:30,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48bcd31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:54:30, skipping insertion in model container [2023-11-24 23:54:30,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:54:29" (2/3) ... [2023-11-24 23:54:30,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48bcd31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:54:30, skipping insertion in model container [2023-11-24 23:54:30,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:54:30" (3/3) ... [2023-11-24 23:54:30,037 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2023-11-24 23:54:30,047 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 23:54:30,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:54:30,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 23:54:30,060 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 23:54:30,144 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 23:54:30,181 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 122 transitions, 251 flow [2023-11-24 23:54:30,307 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1324 states, 1300 states have (on average 1.9330769230769231) internal successors, (2513), 1323 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:30,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:54:30,335 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3129caf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:54:30,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-24 23:54:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 1324 states, 1300 states have (on average 1.9330769230769231) internal successors, (2513), 1323 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:30,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-24 23:54:30,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:30,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:30,352 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:54:30,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1948619337, now seen corresponding path program 1 times [2023-11-24 23:54:30,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:30,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367508274] [2023-11-24 23:54:30,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:30,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:31,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:31,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367508274] [2023-11-24 23:54:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367508274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:31,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:54:31,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618315993] [2023-11-24 23:54:31,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:31,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:54:31,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:31,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:54:31,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:54:31,527 INFO L87 Difference]: Start difference. First operand has 1324 states, 1300 states have (on average 1.9330769230769231) internal successors, (2513), 1323 states have internal predecessors, (2513), 0 states have call successors, (0), 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 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:31,992 INFO L93 Difference]: Finished difference Result 1578 states and 2949 transitions. [2023-11-24 23:54:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:54:31,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-24 23:54:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:32,029 INFO L225 Difference]: With dead ends: 1578 [2023-11-24 23:54:32,029 INFO L226 Difference]: Without dead ends: 1438 [2023-11-24 23:54:32,031 INFO L412 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 [2023-11-24 23:54:32,035 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 122 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:32,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 279 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:54:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2023-11-24 23:54:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1283. [2023-11-24 23:54:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1263 states have (on average 1.894695170229612) internal successors, (2393), 1282 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2393 transitions. [2023-11-24 23:54:32,173 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2393 transitions. Word has length 30 [2023-11-24 23:54:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:32,173 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 2393 transitions. [2023-11-24 23:54:32,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2393 transitions. [2023-11-24 23:54:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-24 23:54:32,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:32,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:32,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:54:32,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:54:32,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1544078002, now seen corresponding path program 1 times [2023-11-24 23:54:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:32,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544902461] [2023-11-24 23:54:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:32,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:32,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544902461] [2023-11-24 23:54:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544902461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:32,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:32,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:54:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635336923] [2023-11-24 23:54:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:32,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:54:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:32,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:54:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:54:32,317 INFO L87 Difference]: Start difference. First operand 1283 states and 2393 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:32,395 INFO L93 Difference]: Finished difference Result 1292 states and 2401 transitions. [2023-11-24 23:54:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:54:32,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-24 23:54:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:32,405 INFO L225 Difference]: With dead ends: 1292 [2023-11-24 23:54:32,405 INFO L226 Difference]: Without dead ends: 1292 [2023-11-24 23:54:32,410 INFO L412 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 [2023-11-24 23:54:32,415 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 49 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:32,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 324 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 23:54:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2023-11-24 23:54:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1284. [2023-11-24 23:54:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1264 states have (on average 1.893987341772152) internal successors, (2394), 1283 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2394 transitions. [2023-11-24 23:54:32,481 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2394 transitions. Word has length 33 [2023-11-24 23:54:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:32,481 INFO L495 AbstractCegarLoop]: Abstraction has 1284 states and 2394 transitions. [2023-11-24 23:54:32,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2394 transitions. [2023-11-24 23:54:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 23:54:32,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:32,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:32,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:54:32,486 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:54:32,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash -340307480, now seen corresponding path program 1 times [2023-11-24 23:54:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:32,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525637738] [2023-11-24 23:54:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:32,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:32,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525637738] [2023-11-24 23:54:32,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525637738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:32,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:32,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:54:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074927282] [2023-11-24 23:54:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:32,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:54:32,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:32,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:54:32,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:54:32,943 INFO L87 Difference]: Start difference. First operand 1284 states and 2394 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 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) [2023-11-24 23:54:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:33,259 INFO L93 Difference]: Finished difference Result 1572 states and 2897 transitions. [2023-11-24 23:54:33,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:54:33,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 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 [2023-11-24 23:54:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:33,272 INFO L225 Difference]: With dead ends: 1572 [2023-11-24 23:54:33,273 INFO L226 Difference]: Without dead ends: 1521 [2023-11-24 23:54:33,273 INFO L412 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 [2023-11-24 23:54:33,274 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 174 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:33,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 200 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:54:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2023-11-24 23:54:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1335. [2023-11-24 23:54:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1318 states have (on average 1.8899848254931715) internal successors, (2491), 1334 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 2491 transitions. [2023-11-24 23:54:33,329 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 2491 transitions. Word has length 34 [2023-11-24 23:54:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:33,329 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 2491 transitions. [2023-11-24 23:54:33,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 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) [2023-11-24 23:54:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 2491 transitions. [2023-11-24 23:54:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-24 23:54:33,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:33,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:33,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:54:33,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:54:33,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash 108159104, now seen corresponding path program 1 times [2023-11-24 23:54:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429490637] [2023-11-24 23:54:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:33,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:33,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429490637] [2023-11-24 23:54:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429490637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:33,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:54:33,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318650962] [2023-11-24 23:54:33,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:33,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:54:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:54:33,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:54:33,827 INFO L87 Difference]: Start difference. First operand 1335 states and 2491 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) [2023-11-24 23:54:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:34,514 INFO L93 Difference]: Finished difference Result 1626 states and 3036 transitions. [2023-11-24 23:54:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:54:34,515 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 [2023-11-24 23:54:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:34,527 INFO L225 Difference]: With dead ends: 1626 [2023-11-24 23:54:34,528 INFO L226 Difference]: Without dead ends: 1505 [2023-11-24 23:54:34,528 INFO L412 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 [2023-11-24 23:54:34,532 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 194 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:34,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 571 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-24 23:54:34,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2023-11-24 23:54:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1411. [2023-11-24 23:54:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1394 states have (on average 1.8830703012912482) internal successors, (2625), 1410 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2625 transitions. [2023-11-24 23:54:34,593 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2625 transitions. Word has length 51 [2023-11-24 23:54:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:34,596 INFO L495 AbstractCegarLoop]: Abstraction has 1411 states and 2625 transitions. [2023-11-24 23:54:34,597 INFO L496 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) [2023-11-24 23:54:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2625 transitions. [2023-11-24 23:54:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-24 23:54:34,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:34,609 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-11-24 23:54:34,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:54:34,610 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:54:34,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash 332487841, now seen corresponding path program 1 times [2023-11-24 23:54:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580110982] [2023-11-24 23:54:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:35,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:35,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580110982] [2023-11-24 23:54:35,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580110982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:54:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542254614] [2023-11-24 23:54:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:35,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:35,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:35,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:54:35,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:54:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:35,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-24 23:54:35,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:54:35,704 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 [2023-11-24 23:54:35,771 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:54:35,772 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 [2023-11-24 23:54:35,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-24 23:54:36,090 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 11 treesize of output 7 [2023-11-24 23:54:36,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 23:54:36,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 23:54:36,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 23:54:36,388 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 37 treesize of output 26 [2023-11-24 23:54:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:36,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:54:36,499 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_190) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_190) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_190) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_190) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0))) is different from false [2023-11-24 23:54:36,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_190) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_190) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_190) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_190) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0))))) is different from false [2023-11-24 23:54:36,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:54:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-24 23:54:36,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542254614] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:54:36,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [773023379] [2023-11-24 23:54:36,818 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-11-24 23:54:36,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:54:36,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 28 [2023-11-24 23:54:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396937046] [2023-11-24 23:54:36,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:54:36,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-24 23:54:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:36,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-24 23:54:36,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=606, Unknown=2, NotChecked=102, Total=812 [2023-11-24 23:54:36,830 INFO L87 Difference]: Start difference. First operand 1411 states and 2625 transitions. Second operand has 29 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:38,998 INFO L93 Difference]: Finished difference Result 1383 states and 2571 transitions. [2023-11-24 23:54:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 23:54:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-11-24 23:54:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:39,009 INFO L225 Difference]: With dead ends: 1383 [2023-11-24 23:54:39,009 INFO L226 Difference]: Without dead ends: 1352 [2023-11-24 23:54:39,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=310, Invalid=1418, Unknown=2, NotChecked=162, Total=1892 [2023-11-24 23:54:39,011 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 949 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 518 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:39,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1371 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1636 Invalid, 0 Unknown, 518 Unchecked, 1.6s Time] [2023-11-24 23:54:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-11-24 23:54:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1294. [2023-11-24 23:54:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1281 states have (on average 1.879000780640125) internal successors, (2407), 1293 states have internal predecessors, (2407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2407 transitions. [2023-11-24 23:54:39,057 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2407 transitions. Word has length 61 [2023-11-24 23:54:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:39,058 INFO L495 AbstractCegarLoop]: Abstraction has 1294 states and 2407 transitions. [2023-11-24 23:54:39,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.9285714285714284) internal successors, (110), 29 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2407 transitions. [2023-11-24 23:54:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-24 23:54:39,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:39,065 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:39,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:54:39,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:39,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:54:39,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:39,274 INFO L85 PathProgramCache]: Analyzing trace with hash 522722670, now seen corresponding path program 1 times [2023-11-24 23:54:39,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:39,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002863828] [2023-11-24 23:54:39,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:39,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:40,052 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002863828] [2023-11-24 23:54:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002863828] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:54:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726713929] [2023-11-24 23:54:40,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:40,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:54:40,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:54:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:40,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-24 23:54:40,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:54:40,209 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 [2023-11-24 23:54:40,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:54:40,222 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 [2023-11-24 23:54:40,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-24 23:54:40,307 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 11 treesize of output 7 [2023-11-24 23:54:40,322 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 21 treesize of output 20 [2023-11-24 23:54:40,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:54:40,342 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 30 treesize of output 32 [2023-11-24 23:54:40,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:54:40,369 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 39 treesize of output 44 [2023-11-24 23:54:40,408 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 43 treesize of output 32 [2023-11-24 23:54:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:40,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:54:40,463 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_291) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_291 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_291) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_291) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_291) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-24 23:54:40,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_291) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_291) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_291 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_291) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_291 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_291) c_threadThread1of1ForFork0_~p~0.base) .cse1)))))) is different from false [2023-11-24 23:54:40,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:54:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-24 23:54:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726713929] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:54:40,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1002884012] [2023-11-24 23:54:40,712 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-11-24 23:54:40,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:54:40,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 16 [2023-11-24 23:54:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556554148] [2023-11-24 23:54:40,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:54:40,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-24 23:54:40,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:40,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-24 23:54:40,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2023-11-24 23:54:40,717 INFO L87 Difference]: Start difference. First operand 1294 states and 2407 transitions. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:43,040 INFO L93 Difference]: Finished difference Result 1396 states and 2589 transitions. [2023-11-24 23:54:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-24 23:54:43,041 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-11-24 23:54:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:43,051 INFO L225 Difference]: With dead ends: 1396 [2023-11-24 23:54:43,051 INFO L226 Difference]: Without dead ends: 1374 [2023-11-24 23:54:43,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1197, Unknown=2, NotChecked=154, Total=1722 [2023-11-24 23:54:43,054 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 857 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1060 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:43,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1728 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1466 Invalid, 0 Unknown, 1060 Unchecked, 1.5s Time] [2023-11-24 23:54:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2023-11-24 23:54:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1271. [2023-11-24 23:54:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1258 states have (on average 1.8696343402225755) internal successors, (2352), 1270 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2352 transitions. [2023-11-24 23:54:43,101 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2352 transitions. Word has length 61 [2023-11-24 23:54:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:43,102 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 2352 transitions. [2023-11-24 23:54:43,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2352 transitions. [2023-11-24 23:54:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-24 23:54:43,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:43,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:43,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:54:43,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:43,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:54:43,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:43,314 INFO L85 PathProgramCache]: Analyzing trace with hash 946631182, now seen corresponding path program 1 times [2023-11-24 23:54:43,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:43,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460561286] [2023-11-24 23:54:43,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:54:43,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:43,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460561286] [2023-11-24 23:54:43,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460561286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:43,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:43,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:54:43,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452793062] [2023-11-24 23:54:43,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:43,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:54:43,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:43,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:54:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:54:43,892 INFO L87 Difference]: Start difference. First operand 1271 states and 2352 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:44,038 INFO L93 Difference]: Finished difference Result 1316 states and 2425 transitions. [2023-11-24 23:54:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:54:44,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-11-24 23:54:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:44,047 INFO L225 Difference]: With dead ends: 1316 [2023-11-24 23:54:44,047 INFO L226 Difference]: Without dead ends: 1197 [2023-11-24 23:54:44,047 INFO L412 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 [2023-11-24 23:54:44,048 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 52 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:44,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 264 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:54:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2023-11-24 23:54:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1193. [2023-11-24 23:54:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1181 states have (on average 1.8619813717188822) internal successors, (2199), 1192 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2199 transitions. [2023-11-24 23:54:44,085 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2199 transitions. Word has length 63 [2023-11-24 23:54:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:44,086 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 2199 transitions. [2023-11-24 23:54:44,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2199 transitions. [2023-11-24 23:54:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-24 23:54:44,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:44,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:44,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 23:54:44,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:54:44,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1502530716, now seen corresponding path program 1 times [2023-11-24 23:54:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542698741] [2023-11-24 23:54:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:44,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:44,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542698741] [2023-11-24 23:54:44,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542698741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:54:44,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601719133] [2023-11-24 23:54:44,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:44,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:44,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:44,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:54:44,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:54:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:44,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-24 23:54:44,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:54:45,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:54:45,396 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:54:45,438 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 19 treesize of output 18 [2023-11-24 23:54:45,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 23:54:45,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 23:54:45,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:54:45,624 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 37 treesize of output 26 [2023-11-24 23:54:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:45,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:54:45,693 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false [2023-11-24 23:54:45,733 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (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|) .cse1 0)))) (and (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false [2023-11-24 23:54:45,756 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (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|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_437 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_437) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false [2023-11-24 23:54:45,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 23:54:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:46,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601719133] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:54:46,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [5694650] [2023-11-24 23:54:46,035 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-11-24 23:54:46,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:54:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2023-11-24 23:54:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843594499] [2023-11-24 23:54:46,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:54:46,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-24 23:54:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-24 23:54:46,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=877, Unknown=3, NotChecked=186, Total=1190 [2023-11-24 23:54:46,039 INFO L87 Difference]: Start difference. First operand 1193 states and 2199 transitions. Second operand has 35 states, 34 states have (on average 4.323529411764706) internal successors, (147), 35 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:47,511 INFO L93 Difference]: Finished difference Result 1151 states and 2118 transitions. [2023-11-24 23:54:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 23:54:47,512 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.323529411764706) internal successors, (147), 35 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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 [2023-11-24 23:54:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:47,522 INFO L225 Difference]: With dead ends: 1151 [2023-11-24 23:54:47,522 INFO L226 Difference]: Without dead ends: 1110 [2023-11-24 23:54:47,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=1594, Unknown=3, NotChecked=258, Total=2162 [2023-11-24 23:54:47,525 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 796 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 690 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:47,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 911 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1014 Invalid, 0 Unknown, 690 Unchecked, 1.0s Time] [2023-11-24 23:54:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-11-24 23:54:47,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1033. [2023-11-24 23:54:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1027 states have (on average 1.8471275559883156) internal successors, (1897), 1032 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1897 transitions. [2023-11-24 23:54:47,563 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1897 transitions. Word has length 64 [2023-11-24 23:54:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:47,564 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1897 transitions. [2023-11-24 23:54:47,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.323529411764706) internal successors, (147), 35 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1897 transitions. [2023-11-24 23:54:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-24 23:54:47,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:47,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:47,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 23:54:47,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-24 23:54:47,774 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:54:47,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash 362708108, now seen corresponding path program 1 times [2023-11-24 23:54:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:47,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798232497] [2023-11-24 23:54:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:48,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:48,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798232497] [2023-11-24 23:54:48,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798232497] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:54:48,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91440601] [2023-11-24 23:54:48,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:48,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:54:48,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:54:48,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:54:48,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:54:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:48,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-24 23:54:48,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:54:48,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:54:48,979 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:54:49,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 23:54:49,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:54:49,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2023-11-24 23:54:49,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:54:49,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 23:54:49,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:54:49,232 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 43 treesize of output 32 [2023-11-24 23:54:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:49,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:54:49,287 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_537 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_537 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_537 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))))) is different from false [2023-11-24 23:54:49,313 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_537 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_537 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_537 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_537 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 23:54:49,337 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_537 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_537 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_537 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_537 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_537) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 23:54:49,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 23:54:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91440601] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:54:49,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1758806319] [2023-11-24 23:54:49,650 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-11-24 23:54:49,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:54:49,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2023-11-24 23:54:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273447677] [2023-11-24 23:54:49,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:54:49,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-24 23:54:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-24 23:54:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=763, Unknown=3, NotChecked=174, Total=1056 [2023-11-24 23:54:49,653 INFO L87 Difference]: Start difference. First operand 1033 states and 1897 transitions. Second operand has 33 states, 32 states have (on average 4.375) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:52,234 INFO L93 Difference]: Finished difference Result 1126 states and 2072 transitions. [2023-11-24 23:54:52,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 23:54:52,234 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.375) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have 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 [2023-11-24 23:54:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:52,242 INFO L225 Difference]: With dead ends: 1126 [2023-11-24 23:54:52,242 INFO L226 Difference]: Without dead ends: 1126 [2023-11-24 23:54:52,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=455, Invalid=1906, Unknown=3, NotChecked=288, Total=2652 [2023-11-24 23:54:52,244 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 719 mSDsluCounter, 2572 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1356 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:52,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2808 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2775 Invalid, 0 Unknown, 1356 Unchecked, 1.9s Time] [2023-11-24 23:54:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2023-11-24 23:54:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1003. [2023-11-24 23:54:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 997 states have (on average 1.851554663991976) internal successors, (1846), 1002 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1846 transitions. [2023-11-24 23:54:52,275 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1846 transitions. Word has length 64 [2023-11-24 23:54:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:52,275 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1846 transitions. [2023-11-24 23:54:52,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.375) internal successors, (140), 33 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1846 transitions. [2023-11-24 23:54:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-24 23:54:52,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:52,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2023-11-24 23:54:52,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:54:52,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-24 23:54:52,485 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-24 23:54:52,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:52,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2097273391, now seen corresponding path program 1 times [2023-11-24 23:54:52,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:52,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451083973] [2023-11-24 23:54:52,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 23:54:52,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 23:54:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 23:54:52,594 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-24 23:54:52,594 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 23:54:52,596 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-24 23:54:52,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-11-24 23:54:52,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-11-24 23:54:52,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2023-11-24 23:54:52,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-11-24 23:54:52,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-11-24 23:54:52,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-11-24 23:54:52,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-11-24 23:54:52,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-11-24 23:54:52,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 23:54:52,604 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:52,606 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 23:54:52,606 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 23:54:52,649 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 23:54:52,658 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 140 transitions, 296 flow [2023-11-24 23:54:53,508 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23322 states, 23256 states have (on average 2.8126934984520124) internal successors, (65412), 23321 states have internal predecessors, (65412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:53,511 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:54:53,512 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3129caf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:54:53,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-24 23:54:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 23322 states, 23256 states have (on average 2.8126934984520124) internal successors, (65412), 23321 states have internal predecessors, (65412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-24 23:54:53,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:53,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:53,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:54:53,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash -709281591, now seen corresponding path program 1 times [2023-11-24 23:54:53,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:53,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159327565] [2023-11-24 23:54:53,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:53,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:53,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159327565] [2023-11-24 23:54:53,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159327565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:53,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:53,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:54:53,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967232883] [2023-11-24 23:54:53,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:53,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:54:53,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:53,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:54:53,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:54:54,006 INFO L87 Difference]: Start difference. First operand has 23322 states, 23256 states have (on average 2.8126934984520124) internal successors, (65412), 23321 states have internal predecessors, (65412), 0 states have call successors, (0), 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 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:54,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:54,816 INFO L93 Difference]: Finished difference Result 33740 states and 93780 transitions. [2023-11-24 23:54:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:54:54,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-24 23:54:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:55,245 INFO L225 Difference]: With dead ends: 33740 [2023-11-24 23:54:55,246 INFO L226 Difference]: Without dead ends: 32820 [2023-11-24 23:54:55,246 INFO L412 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 [2023-11-24 23:54:55,247 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 208 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:55,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 399 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:54:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32820 states. [2023-11-24 23:54:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32820 to 24566. [2023-11-24 23:54:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24566 states, 24506 states have (on average 2.7873990043254713) internal successors, (68308), 24565 states have internal predecessors, (68308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24566 states to 24566 states and 68308 transitions. [2023-11-24 23:54:56,535 INFO L78 Accepts]: Start accepts. Automaton has 24566 states and 68308 transitions. Word has length 30 [2023-11-24 23:54:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:56,535 INFO L495 AbstractCegarLoop]: Abstraction has 24566 states and 68308 transitions. [2023-11-24 23:54:56,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 24566 states and 68308 transitions. [2023-11-24 23:54:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-24 23:54:56,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:56,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:56,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 23:54:56,538 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:54:56,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2034740030, now seen corresponding path program 1 times [2023-11-24 23:54:56,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739371312] [2023-11-24 23:54:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:56,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:56,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739371312] [2023-11-24 23:54:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739371312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:56,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:54:56,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781027336] [2023-11-24 23:54:56,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:56,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:54:56,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:56,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:54:56,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:54:56,618 INFO L87 Difference]: Start difference. First operand 24566 states and 68308 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:57,123 INFO L93 Difference]: Finished difference Result 24575 states and 68316 transitions. [2023-11-24 23:54:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:54:57,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-24 23:54:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:57,267 INFO L225 Difference]: With dead ends: 24575 [2023-11-24 23:54:57,268 INFO L226 Difference]: Without dead ends: 24575 [2023-11-24 23:54:57,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:54:57,269 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 48 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:57,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 478 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:54:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24575 states. [2023-11-24 23:54:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24575 to 24567. [2023-11-24 23:54:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24567 states, 24507 states have (on average 2.7873260701024196) internal successors, (68309), 24566 states have internal predecessors, (68309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24567 states to 24567 states and 68309 transitions. [2023-11-24 23:54:58,461 INFO L78 Accepts]: Start accepts. Automaton has 24567 states and 68309 transitions. Word has length 33 [2023-11-24 23:54:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:54:58,461 INFO L495 AbstractCegarLoop]: Abstraction has 24567 states and 68309 transitions. [2023-11-24 23:54:58,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:54:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 24567 states and 68309 transitions. [2023-11-24 23:54:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 23:54:58,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:54:58,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:54:58,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 23:54:58,463 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:54:58,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:54:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1985313640, now seen corresponding path program 1 times [2023-11-24 23:54:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:54:58,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24192903] [2023-11-24 23:54:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:54:58,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:54:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:54:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:54:58,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:54:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24192903] [2023-11-24 23:54:58,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24192903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:54:58,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:54:58,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:54:58,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468468237] [2023-11-24 23:54:58,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:54:58,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:54:58,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:54:58,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:54:58,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:54:58,884 INFO L87 Difference]: Start difference. First operand 24567 states and 68309 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 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) [2023-11-24 23:54:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:54:59,425 INFO L93 Difference]: Finished difference Result 36252 states and 100392 transitions. [2023-11-24 23:54:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:54:59,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 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 [2023-11-24 23:54:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:54:59,657 INFO L225 Difference]: With dead ends: 36252 [2023-11-24 23:54:59,658 INFO L226 Difference]: Without dead ends: 35931 [2023-11-24 23:54:59,658 INFO L412 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 [2023-11-24 23:54:59,658 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 258 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:54:59,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 305 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:54:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35931 states. [2023-11-24 23:55:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35931 to 27207. [2023-11-24 23:55:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27207 states, 27150 states have (on average 2.7880662983425415) internal successors, (75696), 27206 states have internal predecessors, (75696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27207 states to 27207 states and 75696 transitions. [2023-11-24 23:55:00,548 INFO L78 Accepts]: Start accepts. Automaton has 27207 states and 75696 transitions. Word has length 34 [2023-11-24 23:55:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:00,548 INFO L495 AbstractCegarLoop]: Abstraction has 27207 states and 75696 transitions. [2023-11-24 23:55:00,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 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) [2023-11-24 23:55:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 27207 states and 75696 transitions. [2023-11-24 23:55:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-24 23:55:00,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:00,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:00,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 23:55:00,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:55:00,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash 36319612, now seen corresponding path program 1 times [2023-11-24 23:55:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:00,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087936356] [2023-11-24 23:55:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:55:01,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:01,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087936356] [2023-11-24 23:55:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087936356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:55:01,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:55:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:55:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992365445] [2023-11-24 23:55:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:55:01,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:55:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:55:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:55:01,062 INFO L87 Difference]: Start difference. First operand 27207 states and 75696 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) [2023-11-24 23:55:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:01,678 INFO L93 Difference]: Finished difference Result 35319 states and 98968 transitions. [2023-11-24 23:55:01,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:55:01,679 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 [2023-11-24 23:55:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:01,799 INFO L225 Difference]: With dead ends: 35319 [2023-11-24 23:55:01,799 INFO L226 Difference]: Without dead ends: 34593 [2023-11-24 23:55:01,800 INFO L412 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 [2023-11-24 23:55:01,800 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 276 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:01,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 563 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:55:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34593 states. [2023-11-24 23:55:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34593 to 31653. [2023-11-24 23:55:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31653 states, 31596 states have (on average 2.8001645777946575) internal successors, (88474), 31652 states have internal predecessors, (88474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31653 states to 31653 states and 88474 transitions. [2023-11-24 23:55:02,917 INFO L78 Accepts]: Start accepts. Automaton has 31653 states and 88474 transitions. Word has length 51 [2023-11-24 23:55:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:02,918 INFO L495 AbstractCegarLoop]: Abstraction has 31653 states and 88474 transitions. [2023-11-24 23:55:02,918 INFO L496 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) [2023-11-24 23:55:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 31653 states and 88474 transitions. [2023-11-24 23:55:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-24 23:55:02,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:02,921 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:55:02,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 23:55:02,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:55:02,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1416583200, now seen corresponding path program 1 times [2023-11-24 23:55:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:02,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73821495] [2023-11-24 23:55:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:55:04,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:04,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73821495] [2023-11-24 23:55:04,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73821495] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:04,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876865322] [2023-11-24 23:55:04,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:04,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:04,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:04,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:04,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:55:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:04,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-24 23:55:04,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:04,210 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 [2023-11-24 23:55:04,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:55:04,221 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 [2023-11-24 23:55:04,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-24 23:55:04,281 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 11 treesize of output 7 [2023-11-24 23:55:04,292 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 21 treesize of output 20 [2023-11-24 23:55:04,364 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 25 treesize of output 18 [2023-11-24 23:55:04,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:55:04,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2023-11-24 23:55:04,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:55:04,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 23:55:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:55:04,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:55:04,453 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_778 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_778) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_778 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_778) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false [2023-11-24 23:55:04,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:55:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-24 23:55:04,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876865322] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:55:04,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [481595198] [2023-11-24 23:55:04,621 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java: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) [2023-11-24 23:55:04,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:55:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2023-11-24 23:55:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104664730] [2023-11-24 23:55:04,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:55:04,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-24 23:55:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:55:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-24 23:55:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2023-11-24 23:55:04,625 INFO L87 Difference]: Start difference. First operand 31653 states and 88474 transitions. Second operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 16 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:55:07,652 INFO L93 Difference]: Finished difference Result 36737 states and 103032 transitions. [2023-11-24 23:55:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-24 23:55:07,653 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 16 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-11-24 23:55:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:55:07,765 INFO L225 Difference]: With dead ends: 36737 [2023-11-24 23:55:07,766 INFO L226 Difference]: Without dead ends: 36491 [2023-11-24 23:55:07,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1194, Unknown=1, NotChecked=76, Total=1640 [2023-11-24 23:55:07,767 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 1103 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 915 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-24 23:55:07,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 2888 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2134 Invalid, 0 Unknown, 915 Unchecked, 1.9s Time] [2023-11-24 23:55:07,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36491 states. [2023-11-24 23:55:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36491 to 32201. [2023-11-24 23:55:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32201 states, 32145 states have (on average 2.8020531964535698) internal successors, (90072), 32200 states have internal predecessors, (90072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32201 states to 32201 states and 90072 transitions. [2023-11-24 23:55:08,709 INFO L78 Accepts]: Start accepts. Automaton has 32201 states and 90072 transitions. Word has length 61 [2023-11-24 23:55:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:55:08,710 INFO L495 AbstractCegarLoop]: Abstraction has 32201 states and 90072 transitions. [2023-11-24 23:55:08,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 16 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:55:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 32201 states and 90072 transitions. [2023-11-24 23:55:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-24 23:55:08,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:55:08,715 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-11-24 23:55:08,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 23:55:08,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:08,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-24 23:55:08,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:55:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash 361489643, now seen corresponding path program 1 times [2023-11-24 23:55:08,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:55:08,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054835257] [2023-11-24 23:55:08,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:08,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:55:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:55:09,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:55:09,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054835257] [2023-11-24 23:55:09,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054835257] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:55:09,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721880634] [2023-11-24 23:55:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:55:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:55:09,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:55:09,460 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:55:09,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e9efb14-720e-416a-a918-750466294493/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 23:55:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:55:09,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-24 23:55:09,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:55:09,626 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 [2023-11-24 23:55:09,651 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:55:09,651 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 [2023-11-24 23:55:09,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-24 23:55:09,918 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 11 treesize of output 7 [2023-11-24 23:55:09,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 23:55:10,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 23:55:10,053 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 30 treesize of output 21 [2023-11-24 23:55:10,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:55:10,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 23:55:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:55:10,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:55:10,174 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_878 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_878) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_878 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_878) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_878 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_878) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0))) is different from false [2023-11-24 23:55:10,188 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_878 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_878) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_878 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_878) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_878 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_878) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0))))) is different from false