./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/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_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/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_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/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 3787427d85789c6543b359d801a5f9325d8405a4b765c9b89d348aba34fa2c55 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:00:51,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:00:51,960 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DataRace-32bit-Taipan_Default.epf [2023-11-25 00:00:51,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:00:51,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:00:51,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:00:51,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:00:51,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:00:51,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:00:51,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:00:52,000 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:00:52,001 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:00:52,001 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:00:52,002 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:00:52,002 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:00:52,003 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:00:52,003 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:00:52,004 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:00:52,005 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:00:52,005 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:00:52,006 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:00:52,007 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:00:52,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:00:52,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:00:52,009 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:00:52,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:00:52,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:00:52,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:00:52,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:00:52,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:00:52,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:00:52,012 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-25 00:00:52,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-25 00:00:52,013 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:00:52,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:00:52,013 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:00:52,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:00:52,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:00:52,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:00:52,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:00:52,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:00:52,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:00:52,015 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:00:52,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:00:52,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:00:52,016 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:00:52,016 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:00:52,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:00:52,017 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_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/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_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/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 -> 3787427d85789c6543b359d801a5f9325d8405a4b765c9b89d348aba34fa2c55 [2023-11-25 00:00:52,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:00:52,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:00:52,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:00:52,272 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:00:52,273 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:00:52,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask.i [2023-11-25 00:00:55,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:00:55,882 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:00:55,882 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask.i [2023-11-25 00:00:55,906 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/data/aff6403f0/a5b98f92e6a249d08dd8e859ca896ac8/FLAGca0b5af24 [2023-11-25 00:00:55,935 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/data/aff6403f0/a5b98f92e6a249d08dd8e859ca896ac8 [2023-11-25 00:00:55,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:00:55,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:00:55,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:00:55,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:00:55,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:00:55,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:00:55" (1/1) ... [2023-11-25 00:00:55,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5619a443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:55, skipping insertion in model container [2023-11-25 00:00:55,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:00:55" (1/1) ... [2023-11-25 00:00:56,045 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:00:56,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:00:56,769 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:00:56,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:00:56,911 WARN L675 CHandler]: The function ffs is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:00:56,920 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:00:56,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56 WrapperNode [2023-11-25 00:00:56,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:00:56,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:00:56,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:00:56,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:00:56,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:56,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:57,009 INFO L138 Inliner]: procedures = 281, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2023-11-25 00:00:57,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:00:57,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:00:57,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:00:57,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:00:57,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:57,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:57,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:57,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:57,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:57,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:57,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:57,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:57,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:00:57,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:00:57,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:00:57,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:00:57,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (1/1) ... [2023-11-25 00:00:57,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:00:57,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:00:57,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:00:57,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:00:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:00:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-25 00:00:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:00:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-25 00:00:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-25 00:00:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:00:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:00:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-25 00:00:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:00:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:00:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2023-11-25 00:00:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:00:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-25 00:00:57,128 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-25 00:00:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:00:57,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:00:57,130 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-25 00:00:57,298 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:00:57,300 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:00:57,732 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:00:57,785 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:00:57,785 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-25 00:00:57,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:00:57 BoogieIcfgContainer [2023-11-25 00:00:57,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:00:57,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:00:57,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:00:57,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:00:57,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:00:55" (1/3) ... [2023-11-25 00:00:57,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381e5b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:00:57, skipping insertion in model container [2023-11-25 00:00:57,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:56" (2/3) ... [2023-11-25 00:00:57,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381e5b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:00:57, skipping insertion in model container [2023-11-25 00:00:57,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:00:57" (3/3) ... [2023-11-25 00:00:57,818 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask.i [2023-11-25 00:00:57,825 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-25 00:00:57,834 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:00:57,834 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-11-25 00:00:57,834 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-25 00:00:57,963 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-25 00:00:58,018 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 190 places, 198 transitions, 403 flow [2023-11-25 00:00:58,211 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4450 states, 4386 states have (on average 2.0870953032375743) internal successors, (9154), 4449 states have internal predecessors, (9154), 0 states have call successors, (0), 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-25 00:00:58,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:00:58,245 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;@2feb9d1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:00:58,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-25 00:00:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 4450 states, 4386 states have (on average 2.0870953032375743) internal successors, (9154), 4449 states have internal predecessors, (9154), 0 states have call successors, (0), 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-25 00:00:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-25 00:00:58,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:58,278 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] [2023-11-25 00:00:58,279 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:00:58,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1937937021, now seen corresponding path program 1 times [2023-11-25 00:00:58,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:58,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641425927] [2023-11-25 00:00:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:58,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:58,609 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-25 00:00:58,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641425927] [2023-11-25 00:00:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641425927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:58,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:58,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:00:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81806440] [2023-11-25 00:00:58,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:58,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:00:58,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:58,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:00:58,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:00:58,673 INFO L87 Difference]: Start difference. First operand has 4450 states, 4386 states have (on average 2.0870953032375743) internal successors, (9154), 4449 states have internal predecessors, (9154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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-25 00:00:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:58,834 INFO L93 Difference]: Finished difference Result 4449 states and 9055 transitions. [2023-11-25 00:00:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:00:58,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-25 00:00:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:58,903 INFO L225 Difference]: With dead ends: 4449 [2023-11-25 00:00:58,904 INFO L226 Difference]: Without dead ends: 4382 [2023-11-25 00:00:58,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:00:58,910 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:58,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 360 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:00:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2023-11-25 00:00:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 4382. [2023-11-25 00:00:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4321 states have (on average 2.065262670678084) internal successors, (8924), 4381 states have internal predecessors, (8924), 0 states have call successors, (0), 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-25 00:00:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 8924 transitions. [2023-11-25 00:00:59,284 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 8924 transitions. Word has length 38 [2023-11-25 00:00:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:59,288 INFO L495 AbstractCegarLoop]: Abstraction has 4382 states and 8924 transitions. [2023-11-25 00:00:59,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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-25 00:00:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 8924 transitions. [2023-11-25 00:00:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-25 00:00:59,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:59,292 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] [2023-11-25 00:00:59,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:00:59,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:00:59,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1004342350, now seen corresponding path program 1 times [2023-11-25 00:00:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:59,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674936638] [2023-11-25 00:00:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:59,504 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-25 00:00:59,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674936638] [2023-11-25 00:00:59,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674936638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:59,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:59,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:00:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841216982] [2023-11-25 00:00:59,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:59,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:00:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:59,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:00:59,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:00:59,508 INFO L87 Difference]: Start difference. First operand 4382 states and 8924 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-25 00:00:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:59,638 INFO L93 Difference]: Finished difference Result 4759 states and 9720 transitions. [2023-11-25 00:00:59,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:00:59,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-11-25 00:00:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:59,677 INFO L225 Difference]: With dead ends: 4759 [2023-11-25 00:00:59,677 INFO L226 Difference]: Without dead ends: 4759 [2023-11-25 00:00:59,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:00:59,684 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 135 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:59,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 440 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:00:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4759 states. [2023-11-25 00:00:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4759 to 4274. [2023-11-25 00:00:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4274 states, 4227 states have (on average 2.0577241542465106) internal successors, (8698), 4273 states have internal predecessors, (8698), 0 states have call successors, (0), 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-25 00:00:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 8698 transitions. [2023-11-25 00:00:59,964 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 8698 transitions. Word has length 46 [2023-11-25 00:00:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:59,965 INFO L495 AbstractCegarLoop]: Abstraction has 4274 states and 8698 transitions. [2023-11-25 00:00:59,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-25 00:00:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 8698 transitions. [2023-11-25 00:00:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-25 00:00:59,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:59,971 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-25 00:00:59,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:00:59,971 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:00:59,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1244629649, now seen corresponding path program 1 times [2023-11-25 00:00:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:59,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645260967] [2023-11-25 00:00:59,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:00,306 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-25 00:01:00,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645260967] [2023-11-25 00:01:00,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645260967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:00,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:00,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:01:00,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926751445] [2023-11-25 00:01:00,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:00,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:01:00,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:00,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:01:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:01:00,324 INFO L87 Difference]: Start difference. First operand 4274 states and 8698 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-25 00:01:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:00,486 INFO L93 Difference]: Finished difference Result 4288 states and 8711 transitions. [2023-11-25 00:01:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:01:00,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-25 00:01:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:00,523 INFO L225 Difference]: With dead ends: 4288 [2023-11-25 00:01:00,524 INFO L226 Difference]: Without dead ends: 4288 [2023-11-25 00:01:00,527 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-25 00:01:00,534 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 114 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:00,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 536 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:01:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2023-11-25 00:01:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4275. [2023-11-25 00:01:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4228 states have (on average 2.057473982970672) internal successors, (8699), 4274 states have internal predecessors, (8699), 0 states have call successors, (0), 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-25 00:01:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 8699 transitions. [2023-11-25 00:01:00,703 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 8699 transitions. Word has length 51 [2023-11-25 00:01:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:00,704 INFO L495 AbstractCegarLoop]: Abstraction has 4275 states and 8699 transitions. [2023-11-25 00:01:00,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-25 00:01:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 8699 transitions. [2023-11-25 00:01:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-25 00:01:00,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:00,706 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] [2023-11-25 00:01:00,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-25 00:01:00,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:00,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1556745056, now seen corresponding path program 1 times [2023-11-25 00:01:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407821698] [2023-11-25 00:01:00,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:01,401 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-25 00:01:01,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:01,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407821698] [2023-11-25 00:01:01,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407821698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:01,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:01,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:01:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351891344] [2023-11-25 00:01:01,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:01,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:01:01,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:01,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:01:01,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:01:01,404 INFO L87 Difference]: Start difference. First operand 4275 states and 8699 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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-25 00:01:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:01,843 INFO L93 Difference]: Finished difference Result 5377 states and 10875 transitions. [2023-11-25 00:01:01,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:01:01,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-11-25 00:01:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:01,880 INFO L225 Difference]: With dead ends: 5377 [2023-11-25 00:01:01,881 INFO L226 Difference]: Without dead ends: 5377 [2023-11-25 00:01:01,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:01:01,882 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 314 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:01,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 752 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-25 00:01:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5377 states. [2023-11-25 00:01:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5377 to 4672. [2023-11-25 00:01:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4672 states, 4632 states have (on average 2.0552677029360966) internal successors, (9520), 4671 states have internal predecessors, (9520), 0 states have call successors, (0), 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-25 00:01:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 9520 transitions. [2023-11-25 00:01:02,040 INFO L78 Accepts]: Start accepts. Automaton has 4672 states and 9520 transitions. Word has length 52 [2023-11-25 00:01:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:02,040 INFO L495 AbstractCegarLoop]: Abstraction has 4672 states and 9520 transitions. [2023-11-25 00:01:02,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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-25 00:01:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 4672 states and 9520 transitions. [2023-11-25 00:01:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-25 00:01:02,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:02,043 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] [2023-11-25 00:01:02,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-25 00:01:02,043 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:02,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2025628928, now seen corresponding path program 1 times [2023-11-25 00:01:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540863612] [2023-11-25 00:01:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:02,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:02,101 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-25 00:01:02,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540863612] [2023-11-25 00:01:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540863612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:02,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:01:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510027417] [2023-11-25 00:01:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:02,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:01:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:02,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:01:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:01:02,106 INFO L87 Difference]: Start difference. First operand 4672 states and 9520 transitions. Second operand has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-25 00:01:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:02,180 INFO L93 Difference]: Finished difference Result 4549 states and 9261 transitions. [2023-11-25 00:01:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:01:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-11-25 00:01:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:02,221 INFO L225 Difference]: With dead ends: 4549 [2023-11-25 00:01:02,221 INFO L226 Difference]: Without dead ends: 4437 [2023-11-25 00:01:02,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:01:02,223 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 145 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:02,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 380 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:01:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2023-11-25 00:01:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 4437. [2023-11-25 00:01:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4437 states, 4407 states have (on average 2.0540049920580894) internal successors, (9052), 4436 states have internal predecessors, (9052), 0 states have call successors, (0), 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-25 00:01:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 9052 transitions. [2023-11-25 00:01:02,390 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 9052 transitions. Word has length 56 [2023-11-25 00:01:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:02,391 INFO L495 AbstractCegarLoop]: Abstraction has 4437 states and 9052 transitions. [2023-11-25 00:01:02,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-25 00:01:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 9052 transitions. [2023-11-25 00:01:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-25 00:01:02,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:02,394 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] [2023-11-25 00:01:02,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-25 00:01:02,395 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:02,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash -90704727, now seen corresponding path program 1 times [2023-11-25 00:01:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:02,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280241967] [2023-11-25 00:01:02,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:02,566 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-25 00:01:02,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:02,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280241967] [2023-11-25 00:01:02,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280241967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:02,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:02,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:01:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789242569] [2023-11-25 00:01:02,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:02,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:01:02,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:02,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:01:02,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:01:02,573 INFO L87 Difference]: Start difference. First operand 4437 states and 9052 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-25 00:01:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:02,683 INFO L93 Difference]: Finished difference Result 4446 states and 9062 transitions. [2023-11-25 00:01:02,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:01:02,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-11-25 00:01:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:02,700 INFO L225 Difference]: With dead ends: 4446 [2023-11-25 00:01:02,701 INFO L226 Difference]: Without dead ends: 4446 [2023-11-25 00:01:02,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:01:02,702 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 31 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:02,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 352 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:01:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2023-11-25 00:01:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 4438. [2023-11-25 00:01:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4438 states, 4408 states have (on average 2.053765880217786) internal successors, (9053), 4437 states have internal predecessors, (9053), 0 states have call successors, (0), 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-25 00:01:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 9053 transitions. [2023-11-25 00:01:02,890 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 9053 transitions. Word has length 60 [2023-11-25 00:01:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:02,891 INFO L495 AbstractCegarLoop]: Abstraction has 4438 states and 9053 transitions. [2023-11-25 00:01:02,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-25 00:01:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 9053 transitions. [2023-11-25 00:01:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-25 00:01:02,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:02,898 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] [2023-11-25 00:01:02,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-25 00:01:02,898 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:02,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1702736661, now seen corresponding path program 1 times [2023-11-25 00:01:02,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:02,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042554261] [2023-11-25 00:01:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:03,051 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-25 00:01:03,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:03,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042554261] [2023-11-25 00:01:03,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042554261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:03,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:03,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:01:03,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729884918] [2023-11-25 00:01:03,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:03,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:01:03,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:03,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:01:03,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:01:03,053 INFO L87 Difference]: Start difference. First operand 4438 states and 9053 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-25 00:01:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:03,147 INFO L93 Difference]: Finished difference Result 4445 states and 9060 transitions. [2023-11-25 00:01:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:01:03,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-11-25 00:01:03,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:03,161 INFO L225 Difference]: With dead ends: 4445 [2023-11-25 00:01:03,161 INFO L226 Difference]: Without dead ends: 4445 [2023-11-25 00:01:03,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:01:03,162 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 20 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:03,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 353 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:01:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2023-11-25 00:01:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 4436. [2023-11-25 00:01:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4436 states, 4406 states have (on average 2.0540172492056286) internal successors, (9050), 4435 states have internal predecessors, (9050), 0 states have call successors, (0), 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-25 00:01:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 9050 transitions. [2023-11-25 00:01:03,295 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 9050 transitions. Word has length 60 [2023-11-25 00:01:03,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:03,296 INFO L495 AbstractCegarLoop]: Abstraction has 4436 states and 9050 transitions. [2023-11-25 00:01:03,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-25 00:01:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 9050 transitions. [2023-11-25 00:01:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-25 00:01:03,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:03,297 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] [2023-11-25 00:01:03,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-25 00:01:03,297 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:03,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash -188589783, now seen corresponding path program 1 times [2023-11-25 00:01:03,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:03,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869689916] [2023-11-25 00:01:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:03,400 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-25 00:01:03,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869689916] [2023-11-25 00:01:03,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869689916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:03,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:01:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52120850] [2023-11-25 00:01:03,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:03,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:01:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:01:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:01:03,402 INFO L87 Difference]: Start difference. First operand 4436 states and 9050 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:01:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:03,487 INFO L93 Difference]: Finished difference Result 4444 states and 9058 transitions. [2023-11-25 00:01:03,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:01:03,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-11-25 00:01:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:03,501 INFO L225 Difference]: With dead ends: 4444 [2023-11-25 00:01:03,501 INFO L226 Difference]: Without dead ends: 4444 [2023-11-25 00:01:03,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:01:03,503 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 23 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:03,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 352 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:01:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states. [2023-11-25 00:01:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 4438. [2023-11-25 00:01:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4438 states, 4408 states have (on average 2.0535390199637025) internal successors, (9052), 4437 states have internal predecessors, (9052), 0 states have call successors, (0), 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-25 00:01:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 9052 transitions. [2023-11-25 00:01:03,665 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 9052 transitions. Word has length 61 [2023-11-25 00:01:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:03,665 INFO L495 AbstractCegarLoop]: Abstraction has 4438 states and 9052 transitions. [2023-11-25 00:01:03,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:01:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 9052 transitions. [2023-11-25 00:01:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-25 00:01:03,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:03,667 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] [2023-11-25 00:01:03,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-25 00:01:03,668 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:03,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash -426481603, now seen corresponding path program 1 times [2023-11-25 00:01:03,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153296952] [2023-11-25 00:01:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:03,759 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-25 00:01:03,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:03,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153296952] [2023-11-25 00:01:03,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153296952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:03,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:03,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:01:03,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165836881] [2023-11-25 00:01:03,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:03,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:01:03,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:03,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:01:03,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:01:03,762 INFO L87 Difference]: Start difference. First operand 4438 states and 9052 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:01:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:03,873 INFO L93 Difference]: Finished difference Result 4443 states and 9056 transitions. [2023-11-25 00:01:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:01:03,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-11-25 00:01:03,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:03,886 INFO L225 Difference]: With dead ends: 4443 [2023-11-25 00:01:03,887 INFO L226 Difference]: Without dead ends: 4443 [2023-11-25 00:01:03,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:01:03,888 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 16 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:03,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 464 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:01:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2023-11-25 00:01:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4435. [2023-11-25 00:01:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4435 states, 4405 states have (on average 2.0540295119182748) internal successors, (9048), 4434 states have internal predecessors, (9048), 0 states have call successors, (0), 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-25 00:01:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4435 states to 4435 states and 9048 transitions. [2023-11-25 00:01:03,996 INFO L78 Accepts]: Start accepts. Automaton has 4435 states and 9048 transitions. Word has length 61 [2023-11-25 00:01:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:03,997 INFO L495 AbstractCegarLoop]: Abstraction has 4435 states and 9048 transitions. [2023-11-25 00:01:03,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:01:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4435 states and 9048 transitions. [2023-11-25 00:01:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-25 00:01:03,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:03,998 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, 1] [2023-11-25 00:01:03,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-25 00:01:03,998 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:03,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash 118216292, now seen corresponding path program 1 times [2023-11-25 00:01:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:03,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981152032] [2023-11-25 00:01:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:04,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:04,046 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-25 00:01:04,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:04,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981152032] [2023-11-25 00:01:04,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981152032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:04,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:04,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:01:04,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277852358] [2023-11-25 00:01:04,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:04,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:01:04,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:04,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:01:04,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:01:04,049 INFO L87 Difference]: Start difference. First operand 4435 states and 9048 transitions. Second operand has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:01:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:04,115 INFO L93 Difference]: Finished difference Result 4516 states and 9219 transitions. [2023-11-25 00:01:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:01:04,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-11-25 00:01:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:04,129 INFO L225 Difference]: With dead ends: 4516 [2023-11-25 00:01:04,129 INFO L226 Difference]: Without dead ends: 4516 [2023-11-25 00:01:04,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:01:04,130 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 49 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:04,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 387 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:01:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2023-11-25 00:01:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 4438. [2023-11-25 00:01:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4438 states, 4411 states have (on average 2.0532759011562005) internal successors, (9057), 4437 states have internal predecessors, (9057), 0 states have call successors, (0), 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-25 00:01:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 9057 transitions. [2023-11-25 00:01:04,277 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 9057 transitions. Word has length 65 [2023-11-25 00:01:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:04,277 INFO L495 AbstractCegarLoop]: Abstraction has 4438 states and 9057 transitions. [2023-11-25 00:01:04,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:01:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 9057 transitions. [2023-11-25 00:01:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-25 00:01:04,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:04,280 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, 1, 1, 1, 1, 1, 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-25 00:01:04,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-25 00:01:04,280 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:04,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1479071995, now seen corresponding path program 1 times [2023-11-25 00:01:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083716867] [2023-11-25 00:01:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:05,050 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-25 00:01:05,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:05,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083716867] [2023-11-25 00:01:05,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083716867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:05,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:05,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:01:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536281306] [2023-11-25 00:01:05,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:05,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:01:05,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:05,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:01:05,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:01:05,054 INFO L87 Difference]: Start difference. First operand 4438 states and 9057 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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-25 00:01:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:05,667 INFO L93 Difference]: Finished difference Result 4631 states and 9420 transitions. [2023-11-25 00:01:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:01:05,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2023-11-25 00:01:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:05,686 INFO L225 Difference]: With dead ends: 4631 [2023-11-25 00:01:05,686 INFO L226 Difference]: Without dead ends: 4631 [2023-11-25 00:01:05,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:01:05,687 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 300 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:05,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 971 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-25 00:01:05,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2023-11-25 00:01:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4537. [2023-11-25 00:01:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4537 states, 4510 states have (on average 2.0483370288248337) internal successors, (9238), 4536 states have internal predecessors, (9238), 0 states have call successors, (0), 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-25 00:01:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 9238 transitions. [2023-11-25 00:01:05,848 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 9238 transitions. Word has length 93 [2023-11-25 00:01:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:05,849 INFO L495 AbstractCegarLoop]: Abstraction has 4537 states and 9238 transitions. [2023-11-25 00:01:05,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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-25 00:01:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 9238 transitions. [2023-11-25 00:01:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-25 00:01:05,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:05,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:01:05,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-25 00:01:05,854 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:05,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2109754094, now seen corresponding path program 1 times [2023-11-25 00:01:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:05,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856227997] [2023-11-25 00:01:05,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:06,677 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-25 00:01:06,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:06,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856227997] [2023-11-25 00:01:06,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856227997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:06,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:06,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:01:06,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610944041] [2023-11-25 00:01:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:06,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:01:06,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:06,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:01:06,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:01:06,681 INFO L87 Difference]: Start difference. First operand 4537 states and 9238 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 00:01:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:07,063 INFO L93 Difference]: Finished difference Result 4710 states and 9556 transitions. [2023-11-25 00:01:07,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:01:07,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-11-25 00:01:07,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:07,079 INFO L225 Difference]: With dead ends: 4710 [2023-11-25 00:01:07,079 INFO L226 Difference]: Without dead ends: 4555 [2023-11-25 00:01:07,080 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-25 00:01:07,080 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 174 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:07,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1137 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:01:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2023-11-25 00:01:07,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4524. [2023-11-25 00:01:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4498 states have (on average 2.050466874166296) internal successors, (9223), 4523 states have internal predecessors, (9223), 0 states have call successors, (0), 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-25 00:01:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 9223 transitions. [2023-11-25 00:01:07,193 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 9223 transitions. Word has length 102 [2023-11-25 00:01:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:07,194 INFO L495 AbstractCegarLoop]: Abstraction has 4524 states and 9223 transitions. [2023-11-25 00:01:07,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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-25 00:01:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 9223 transitions. [2023-11-25 00:01:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-25 00:01:07,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:07,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:01:07,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-25 00:01:07,199 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:07,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash -242024190, now seen corresponding path program 1 times [2023-11-25 00:01:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:07,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019626204] [2023-11-25 00:01:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:01:08,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:08,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019626204] [2023-11-25 00:01:08,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019626204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:08,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-25 00:01:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429834505] [2023-11-25 00:01:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:08,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-25 00:01:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:08,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-25 00:01:08,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-25 00:01:08,050 INFO L87 Difference]: Start difference. First operand 4524 states and 9223 transitions. Second operand has 10 states, 9 states have (on average 11.666666666666666) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 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-25 00:01:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:08,999 INFO L93 Difference]: Finished difference Result 4510 states and 9192 transitions. [2023-11-25 00:01:08,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-25 00:01:09,000 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.666666666666666) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2023-11-25 00:01:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:09,013 INFO L225 Difference]: With dead ends: 4510 [2023-11-25 00:01:09,014 INFO L226 Difference]: Without dead ends: 4510 [2023-11-25 00:01:09,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-11-25 00:01:09,015 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 600 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:09,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1499 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-25 00:01:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2023-11-25 00:01:09,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4402. [2023-11-25 00:01:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4402 states, 4380 states have (on average 2.0518264840182647) internal successors, (8987), 4401 states have internal predecessors, (8987), 0 states have call successors, (0), 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-25 00:01:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4402 states to 4402 states and 8987 transitions. [2023-11-25 00:01:09,134 INFO L78 Accepts]: Start accepts. Automaton has 4402 states and 8987 transitions. Word has length 105 [2023-11-25 00:01:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:09,135 INFO L495 AbstractCegarLoop]: Abstraction has 4402 states and 8987 transitions. [2023-11-25 00:01:09,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.666666666666666) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 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-25 00:01:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4402 states and 8987 transitions. [2023-11-25 00:01:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-25 00:01:09,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:09,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:01:09,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-25 00:01:09,142 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:09,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:09,142 INFO L85 PathProgramCache]: Analyzing trace with hash -653413498, now seen corresponding path program 1 times [2023-11-25 00:01:09,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:09,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172919086] [2023-11-25 00:01:09,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:09,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:09,884 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-25 00:01:09,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:09,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172919086] [2023-11-25 00:01:09,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172919086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-25 00:01:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805147700] [2023-11-25 00:01:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:09,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-25 00:01:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-25 00:01:09,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-25 00:01:09,887 INFO L87 Difference]: Start difference. First operand 4402 states and 8987 transitions. Second operand has 10 states, 9 states have (on average 11.666666666666666) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 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-25 00:01:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:10,206 INFO L93 Difference]: Finished difference Result 4297 states and 8768 transitions. [2023-11-25 00:01:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-25 00:01:10,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.666666666666666) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2023-11-25 00:01:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:10,218 INFO L225 Difference]: With dead ends: 4297 [2023-11-25 00:01:10,219 INFO L226 Difference]: Without dead ends: 4233 [2023-11-25 00:01:10,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-11-25 00:01:10,220 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 568 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:10,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 695 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:01:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2023-11-25 00:01:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 3877. [2023-11-25 00:01:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3877 states, 3861 states have (on average 2.051282051282051) internal successors, (7920), 3876 states have internal predecessors, (7920), 0 states have call successors, (0), 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-25 00:01:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 7920 transitions. [2023-11-25 00:01:10,324 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 7920 transitions. Word has length 105 [2023-11-25 00:01:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:10,325 INFO L495 AbstractCegarLoop]: Abstraction has 3877 states and 7920 transitions. [2023-11-25 00:01:10,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.666666666666666) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 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-25 00:01:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 7920 transitions. [2023-11-25 00:01:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-25 00:01:10,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:10,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:01:10,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-25 00:01:10,330 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:10,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash 256638793, now seen corresponding path program 1 times [2023-11-25 00:01:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:10,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951089800] [2023-11-25 00:01:10,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:10,412 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-25 00:01:10,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:10,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951089800] [2023-11-25 00:01:10,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951089800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:10,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:10,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:01:10,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479314930] [2023-11-25 00:01:10,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:10,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:01:10,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:10,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:01:10,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:01:10,416 INFO L87 Difference]: Start difference. First operand 3877 states and 7920 transitions. Second operand has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-25 00:01:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:10,483 INFO L93 Difference]: Finished difference Result 3974 states and 8122 transitions. [2023-11-25 00:01:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:01:10,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-11-25 00:01:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:10,493 INFO L225 Difference]: With dead ends: 3974 [2023-11-25 00:01:10,493 INFO L226 Difference]: Without dead ends: 3016 [2023-11-25 00:01:10,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:01:10,496 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 90 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:10,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 412 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:01:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2023-11-25 00:01:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 2899. [2023-11-25 00:01:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2899 states, 2889 states have (on average 2.022152994115611) internal successors, (5842), 2898 states have internal predecessors, (5842), 0 states have call successors, (0), 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-25 00:01:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 5842 transitions. [2023-11-25 00:01:10,616 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 5842 transitions. Word has length 107 [2023-11-25 00:01:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:10,617 INFO L495 AbstractCegarLoop]: Abstraction has 2899 states and 5842 transitions. [2023-11-25 00:01:10,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-25 00:01:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 5842 transitions. [2023-11-25 00:01:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-25 00:01:10,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:10,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:01:10,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-25 00:01:10,623 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:10,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash 976658147, now seen corresponding path program 1 times [2023-11-25 00:01:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:10,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863340993] [2023-11-25 00:01:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:10,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:12,308 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-25 00:01:12,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:12,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863340993] [2023-11-25 00:01:12,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863340993] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:01:12,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800732926] [2023-11-25 00:01:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:12,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:01:12,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:01:12,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:01:12,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:01:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:12,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-25 00:01:12,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:01:12,636 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-25 00:01:12,686 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-25 00:01:12,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-25 00:01:12,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:12,835 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-25 00:01:12,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-25 00:01:13,397 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-25 00:01:13,398 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-25 00:01:13,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:13,544 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-25 00:01:13,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-25 00:01:13,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-25 00:01:13,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:01:13,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-25 00:01:13,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:01:13,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-25 00:01:14,100 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 24 treesize of output 12 [2023-11-25 00:01:14,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:14,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-25 00:01:14,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:14,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-25 00:01:14,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:14,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-25 00:01:14,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:14,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-25 00:01:14,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-25 00:01:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:01:14,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:01:14,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800732926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:14,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-25 00:01:14,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25 [2023-11-25 00:01:14,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416151821] [2023-11-25 00:01:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:14,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-25 00:01:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:14,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-25 00:01:14,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2023-11-25 00:01:14,472 INFO L87 Difference]: Start difference. First operand 2899 states and 5842 transitions. Second operand has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 0 states have call successors, (0), 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-25 00:01:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:16,360 INFO L93 Difference]: Finished difference Result 2919 states and 5867 transitions. [2023-11-25 00:01:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-25 00:01:16,361 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-11-25 00:01:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:16,369 INFO L225 Difference]: With dead ends: 2919 [2023-11-25 00:01:16,369 INFO L226 Difference]: Without dead ends: 2903 [2023-11-25 00:01:16,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2023-11-25 00:01:16,370 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 755 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:16,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 2172 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-25 00:01:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2023-11-25 00:01:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2895. [2023-11-25 00:01:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2885 states have (on average 2.021837088388215) internal successors, (5833), 2894 states have internal predecessors, (5833), 0 states have call successors, (0), 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-25 00:01:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 5833 transitions. [2023-11-25 00:01:16,441 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 5833 transitions. Word has length 111 [2023-11-25 00:01:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:16,442 INFO L495 AbstractCegarLoop]: Abstraction has 2895 states and 5833 transitions. [2023-11-25 00:01:16,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 0 states have call successors, (0), 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-25 00:01:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 5833 transitions. [2023-11-25 00:01:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-25 00:01:16,445 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:16,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:01:16,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:01:16,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:01:16,652 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:16,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:16,653 INFO L85 PathProgramCache]: Analyzing trace with hash 906601563, now seen corresponding path program 2 times [2023-11-25 00:01:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:16,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201700400] [2023-11-25 00:01:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:18,031 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-25 00:01:18,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201700400] [2023-11-25 00:01:18,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201700400] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:01:18,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585454667] [2023-11-25 00:01:18,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:01:18,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:01:18,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:01:18,034 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:01:18,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:01:18,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-25 00:01:18,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:01:18,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-25 00:01:18,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:01:18,257 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-25 00:01:18,351 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-25 00:01:18,351 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 15 treesize of output 15 [2023-11-25 00:01:18,917 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-25 00:01:18,918 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-25 00:01:19,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:19,073 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 26 treesize of output 19 [2023-11-25 00:01:19,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-25 00:01:19,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-25 00:01:19,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:01:19,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-25 00:01:19,449 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 25 treesize of output 13 [2023-11-25 00:01:19,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:19,547 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 44 treesize of output 35 [2023-11-25 00:01:19,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:01:19,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-25 00:01:19,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:19,686 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 56 treesize of output 45 [2023-11-25 00:01:19,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:19,728 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 56 treesize of output 45 [2023-11-25 00:01:19,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:19,760 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 56 treesize of output 45 [2023-11-25 00:01:19,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-25 00:01:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:01:19,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:01:19,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585454667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:19,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-25 00:01:19,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-25 00:01:19,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789880231] [2023-11-25 00:01:19,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:19,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-25 00:01:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:19,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-25 00:01:19,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2023-11-25 00:01:19,846 INFO L87 Difference]: Start difference. First operand 2895 states and 5833 transitions. Second operand has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 0 states have call successors, (0), 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-25 00:01:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:22,044 INFO L93 Difference]: Finished difference Result 2942 states and 5909 transitions. [2023-11-25 00:01:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-25 00:01:22,045 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-11-25 00:01:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:22,054 INFO L225 Difference]: With dead ends: 2942 [2023-11-25 00:01:22,054 INFO L226 Difference]: Without dead ends: 2929 [2023-11-25 00:01:22,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=393, Invalid=1587, Unknown=0, NotChecked=0, Total=1980 [2023-11-25 00:01:22,056 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 589 mSDsluCounter, 2000 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:22,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 2344 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-25 00:01:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2023-11-25 00:01:22,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2909. [2023-11-25 00:01:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2909 states, 2899 states have (on average 2.0189720593308036) internal successors, (5853), 2908 states have internal predecessors, (5853), 0 states have call successors, (0), 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-25 00:01:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 5853 transitions. [2023-11-25 00:01:22,131 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 5853 transitions. Word has length 111 [2023-11-25 00:01:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:22,131 INFO L495 AbstractCegarLoop]: Abstraction has 2909 states and 5853 transitions. [2023-11-25 00:01:22,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 0 states have call successors, (0), 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-25 00:01:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 5853 transitions. [2023-11-25 00:01:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-25 00:01:22,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:22,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 00:01:22,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:01:22,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-25 00:01:22,343 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-25 00:01:22,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2049853731, now seen corresponding path program 3 times [2023-11-25 00:01:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814482983] [2023-11-25 00:01:22,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:23,788 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-25 00:01:23,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814482983] [2023-11-25 00:01:23,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814482983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:01:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874082818] [2023-11-25 00:01:23,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-25 00:01:23,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:01:23,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:01:23,803 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:01:23,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54190e0b-c510-4a00-8c0b-e3ef3ada2d0e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:01:24,230 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-25 00:01:24,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:01:24,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-25 00:01:24,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:01:24,255 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-25 00:01:24,301 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-25 00:01:24,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-25 00:01:24,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:24,445 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-25 00:01:24,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-25 00:01:25,358 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 7 treesize of output 3 [2023-11-25 00:01:25,540 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-25 00:01:25,540 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-25 00:01:25,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:25,990 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-25 00:01:26,042 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-25 00:01:26,124 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-25 00:01:26,294 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 24 treesize of output 12 [2023-11-25 00:01:26,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:26,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-25 00:01:26,425 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-25 00:01:26,517 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-25 00:01:26,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:26,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-25 00:01:26,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:26,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-25 00:01:26,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:01:26,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-25 00:01:26,813 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-25 00:01:26,879 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-25 00:01:26,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:01:26,937 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of1ForFork0_~j~0 4))) (and (forall ((v_ArrVal_630 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_630 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_630 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_630 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-25 00:01:26,987 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of1ForFork0_~j~0 4))) (and (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-25 00:01:27,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-25 00:01:27,366 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse0 (+ c_~datas~0.offset 2 .cse2)) (.cse1 (+ c_~datas~0.offset 3 .cse2))) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_623) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_623) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_623) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_623) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-25 00:01:27,405 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse0 (+ c_~datas~0.offset 2 .cse3)) (.cse1 (+ c_~datas~0.offset 3 .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_623) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) .cse2 v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_623) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) .cse2 v_ArrVal_630) c_~datas~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_623) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) .cse2 v_ArrVal_630) c_~datas~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_623) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_629) .cse2 v_ArrVal_630) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-25 00:01:27,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:01:27,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 112 [2023-11-25 00:01:27,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:01:27,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 95 [2023-11-25 00:01:27,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2023-11-25 00:01:27,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2023-11-25 00:01:27,890 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:01:27,891 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:01:27,894 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:01:27,894 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:01:27,901 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-25 00:01:27,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 1 [2023-11-25 00:01:27,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:01:27,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:01:28,609 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 8 treesize of output 4 [2023-11-25 00:01:28,614 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 92 treesize of output 64 [2023-11-25 00:01:28,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-11-25 00:01:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-25 00:01:28,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874082818] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:01:28,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [944425133] [2023-11-25 00:01:28,897 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-25 00:01:28,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:01:28,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 16] total 47 [2023-11-25 00:01:28,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327911355] [2023-11-25 00:01:28,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:01:28,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-25 00:01:28,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:28,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-25 00:01:28,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1580, Unknown=51, NotChecked=430, Total=2256 [2023-11-25 00:01:28,905 INFO L87 Difference]: Start difference. First operand 2909 states and 5853 transitions. Second operand has 48 states, 47 states have (on average 5.51063829787234) internal successors, (259), 48 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)