./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:13:54,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:13:54,863 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:13:54,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:13:54,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:13:54,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:13:54,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:13:54,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:13:54,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:13:54,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:13:54,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:13:54,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:13:54,907 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:13:54,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:13:54,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:13:54,908 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:13:54,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:13:54,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:13:54,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:13:54,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:13:54,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:13:54,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:13:54,914 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:13:54,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:13:54,915 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:13:54,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:13:54,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:13:54,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:13:54,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:13:54,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:13:54,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:13:54,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:54,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:13:54,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:13:54,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:13:54,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:13:54,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:13:54,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:13:54,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:13:54,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:13:54,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:13:54,925 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/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_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU 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 -> Automizer 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2024-10-31 22:13:55,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:13:55,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:13:55,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:13:55,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:13:55,272 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:13:55,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c Unable to find full path for "g++" [2024-10-31 22:13:57,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:13:57,682 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:13:57,685 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-10-31 22:13:57,700 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/data/0580c74c5/c3a4b0e150ae484d80ebfbb239ec46e2/FLAGfc226ce18 [2024-10-31 22:13:57,948 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/data/0580c74c5/c3a4b0e150ae484d80ebfbb239ec46e2 [2024-10-31 22:13:57,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:13:57,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:13:57,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:57,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:13:57,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:13:57,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:57" (1/1) ... [2024-10-31 22:13:57,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3f5b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:57, skipping insertion in model container [2024-10-31 22:13:57,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:57" (1/1) ... [2024-10-31 22:13:58,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:13:58,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:58,284 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:13:58,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:58,335 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:13:58,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58 WrapperNode [2024-10-31 22:13:58,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:58,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:58,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:13:58,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:13:58,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,402 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 384 [2024-10-31 22:13:58,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:58,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:13:58,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:13:58,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:13:58,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:13:58,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:13:58,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:13:58,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:13:58,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (1/1) ... [2024-10-31 22:13:58,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:58,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:58,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:58,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e766e0b-585c-48b0-b879-f44fd5e33d7e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:13:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:13:58,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 22:13:58,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 22:13:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 22:13:58,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 22:13:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-31 22:13:58,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-31 22:13:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:13:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:13:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:13:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:13:58,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:13:58,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:13:58,564 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:13:58,763 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:13:58,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:13:59,737 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:13:59,737 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:13:59,782 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:13:59,782 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-31 22:13:59,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:59 BoogieIcfgContainer [2024-10-31 22:13:59,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:13:59,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:13:59,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:13:59,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:13:59,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:13:57" (1/3) ... [2024-10-31 22:13:59,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794ae932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:59, skipping insertion in model container [2024-10-31 22:13:59,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:58" (2/3) ... [2024-10-31 22:13:59,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794ae932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:59, skipping insertion in model container [2024-10-31 22:13:59,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:59" (3/3) ... [2024-10-31 22:13:59,800 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2024-10-31 22:13:59,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:13:59,820 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-10-31 22:13:59,820 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:14:00,079 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-31 22:14:00,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 499 places, 518 transitions, 1057 flow [2024-10-31 22:14:00,421 INFO L124 PetriNetUnfolderBase]: 29/515 cut-off events. [2024-10-31 22:14:00,426 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:14:00,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 515 events. 29/515 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 867 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 339. Up to 2 conditions per place. [2024-10-31 22:14:00,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 499 places, 518 transitions, 1057 flow [2024-10-31 22:14:00,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 471 transitions, 960 flow [2024-10-31 22:14:00,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:14:00,472 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, 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;@11201449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:14:00,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-10-31 22:14:00,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:14:00,481 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-31 22:14:00,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:14:00,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:00,482 INFO L204 CegarLoopForPetriNet]: 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] [2024-10-31 22:14:00,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:00,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash -97437285, now seen corresponding path program 1 times [2024-10-31 22:14:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:00,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236511783] [2024-10-31 22:14:00,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:00,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236511783] [2024-10-31 22:14:00,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236511783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:00,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:00,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317342347] [2024-10-31 22:14:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:00,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:00,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:00,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:00,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:00,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 518 [2024-10-31 22:14:00,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 471 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:00,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:00,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 518 [2024-10-31 22:14:00,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:01,282 INFO L124 PetriNetUnfolderBase]: 33/1039 cut-off events. [2024-10-31 22:14:01,284 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-31 22:14:01,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1039 events. 33/1039 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5177 event pairs, 15 based on Foata normal form. 37/937 useless extension candidates. Maximal degree in co-relation 824. Up to 55 conditions per place. [2024-10-31 22:14:01,305 INFO L140 encePairwiseOnDemand]: 495/518 looper letters, 15 selfloop transitions, 2 changer transitions 6/450 dead transitions. [2024-10-31 22:14:01,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 952 flow [2024-10-31 22:14:01,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-10-31 22:14:01,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-10-31 22:14:01,372 INFO L175 Difference]: Start difference. First operand has 455 places, 471 transitions, 960 flow. Second operand 3 states and 1463 transitions. [2024-10-31 22:14:01,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 952 flow [2024-10-31 22:14:01,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 940 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-31 22:14:01,388 INFO L231 Difference]: Finished difference. Result has 450 places, 444 transitions, 898 flow [2024-10-31 22:14:01,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=450, PETRI_TRANSITIONS=444} [2024-10-31 22:14:01,395 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-10-31 22:14:01,395 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 898 flow [2024-10-31 22:14:01,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:01,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:01,397 INFO L204 CegarLoopForPetriNet]: 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] [2024-10-31 22:14:01,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:14:01,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:01,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:01,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1490081496, now seen corresponding path program 1 times [2024-10-31 22:14:01,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:01,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978993305] [2024-10-31 22:14:01,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:01,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:01,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978993305] [2024-10-31 22:14:01,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978993305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:01,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:01,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:01,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411271416] [2024-10-31 22:14:01,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:01,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:01,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:01,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:01,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:01,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 518 [2024-10-31 22:14:01,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 444 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:01,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:01,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 518 [2024-10-31 22:14:01,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:02,286 INFO L124 PetriNetUnfolderBase]: 100/2658 cut-off events. [2024-10-31 22:14:02,287 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-31 22:14:02,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 2658 events. 100/2658 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 19686 event pairs, 56 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 2797. Up to 152 conditions per place. [2024-10-31 22:14:02,308 INFO L140 encePairwiseOnDemand]: 511/518 looper letters, 18 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2024-10-31 22:14:02,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 924 flow [2024-10-31 22:14:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2024-10-31 22:14:02,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9214929214929215 [2024-10-31 22:14:02,314 INFO L175 Difference]: Start difference. First operand has 450 places, 444 transitions, 898 flow. Second operand 3 states and 1432 transitions. [2024-10-31 22:14:02,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 924 flow [2024-10-31 22:14:02,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 438 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:14:02,323 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 884 flow [2024-10-31 22:14:02,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=438, PETRI_TRANSITIONS=438} [2024-10-31 22:14:02,325 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-10-31 22:14:02,325 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 884 flow [2024-10-31 22:14:02,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:02,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:02,327 INFO L204 CegarLoopForPetriNet]: 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] [2024-10-31 22:14:02,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:14:02,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:02,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:02,328 INFO L85 PathProgramCache]: Analyzing trace with hash -750720517, now seen corresponding path program 1 times [2024-10-31 22:14:02,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:02,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324597304] [2024-10-31 22:14:02,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:02,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:03,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:03,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324597304] [2024-10-31 22:14:03,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324597304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:03,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158621196] [2024-10-31 22:14:03,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:03,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:14:03,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:03,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:14:03,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:03,810 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 518 [2024-10-31 22:14:03,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 438 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:03,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:03,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 518 [2024-10-31 22:14:03,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:05,699 INFO L124 PetriNetUnfolderBase]: 1199/6233 cut-off events. [2024-10-31 22:14:05,699 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2024-10-31 22:14:05,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8054 conditions, 6233 events. 1199/6233 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 54396 event pairs, 864 based on Foata normal form. 0/5379 useless extension candidates. Maximal degree in co-relation 8023. Up to 1772 conditions per place. [2024-10-31 22:14:05,776 INFO L140 encePairwiseOnDemand]: 500/518 looper letters, 54 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2024-10-31 22:14:05,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1016 flow [2024-10-31 22:14:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:14:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:14:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2024-10-31 22:14:05,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8378378378378378 [2024-10-31 22:14:05,785 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 884 flow. Second operand 6 states and 2604 transitions. [2024-10-31 22:14:05,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1016 flow [2024-10-31 22:14:05,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:14:05,797 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 907 flow [2024-10-31 22:14:05,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=907, PETRI_PLACES=439, PETRI_TRANSITIONS=435} [2024-10-31 22:14:05,799 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-10-31 22:14:05,799 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 907 flow [2024-10-31 22:14:05,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:05,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:05,802 INFO L204 CegarLoopForPetriNet]: 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] [2024-10-31 22:14:05,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:14:05,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:05,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1977528840, now seen corresponding path program 1 times [2024-10-31 22:14:05,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:05,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422033347] [2024-10-31 22:14:05,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:05,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:05,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:05,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422033347] [2024-10-31 22:14:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422033347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:05,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:05,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:05,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097843020] [2024-10-31 22:14:05,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:05,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:05,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:05,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:05,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:05,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-10-31 22:14:05,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 435 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:05,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:05,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-10-31 22:14:05,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:06,143 INFO L124 PetriNetUnfolderBase]: 13/623 cut-off events. [2024-10-31 22:14:06,144 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 22:14:06,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 623 events. 13/623 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1674 event pairs, 5 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 638. Up to 22 conditions per place. [2024-10-31 22:14:06,151 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2024-10-31 22:14:06,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 434 transitions, 931 flow [2024-10-31 22:14:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-10-31 22:14:06,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-10-31 22:14:06,156 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 907 flow. Second operand 3 states and 1451 transitions. [2024-10-31 22:14:06,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 434 transitions, 931 flow [2024-10-31 22:14:06,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 434 transitions, 901 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:14:06,164 INFO L231 Difference]: Finished difference. Result has 435 places, 434 transitions, 879 flow [2024-10-31 22:14:06,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=879, PETRI_PLACES=435, PETRI_TRANSITIONS=434} [2024-10-31 22:14:06,166 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -20 predicate places. [2024-10-31 22:14:06,166 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 434 transitions, 879 flow [2024-10-31 22:14:06,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:06,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:06,168 INFO L204 CegarLoopForPetriNet]: 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] [2024-10-31 22:14:06,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:14:06,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:06,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1497042718, now seen corresponding path program 1 times [2024-10-31 22:14:06,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:06,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427208685] [2024-10-31 22:14:06,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:06,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:06,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:06,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427208685] [2024-10-31 22:14:06,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427208685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:06,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:06,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:06,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455588722] [2024-10-31 22:14:06,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:06,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:06,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:06,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-10-31 22:14:06,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 434 transitions, 879 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:06,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:06,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-10-31 22:14:06,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:06,368 INFO L124 PetriNetUnfolderBase]: 14/563 cut-off events. [2024-10-31 22:14:06,368 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:14:06,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 563 events. 14/563 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1312 event pairs, 7 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 567. Up to 25 conditions per place. [2024-10-31 22:14:06,377 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-10-31 22:14:06,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 903 flow [2024-10-31 22:14:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-10-31 22:14:06,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-10-31 22:14:06,382 INFO L175 Difference]: Start difference. First operand has 435 places, 434 transitions, 879 flow. Second operand 3 states and 1451 transitions. [2024-10-31 22:14:06,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 903 flow [2024-10-31 22:14:06,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 433 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:14:06,390 INFO L231 Difference]: Finished difference. Result has 434 places, 433 transitions, 877 flow [2024-10-31 22:14:06,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=434, PETRI_TRANSITIONS=433} [2024-10-31 22:14:06,392 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-10-31 22:14:06,392 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 433 transitions, 877 flow [2024-10-31 22:14:06,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:06,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:06,394 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:06,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:14:06,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:06,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash -843219424, now seen corresponding path program 1 times [2024-10-31 22:14:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:06,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999662886] [2024-10-31 22:14:06,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999662886] [2024-10-31 22:14:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999662886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850673356] [2024-10-31 22:14:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:06,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:06,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:06,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:06,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:06,523 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-10-31 22:14:06,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 433 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:06,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:06,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-10-31 22:14:06,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:06,614 INFO L124 PetriNetUnfolderBase]: 10/440 cut-off events. [2024-10-31 22:14:06,614 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:14:06,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 440 events. 10/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 798 event pairs, 4 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 438. Up to 20 conditions per place. [2024-10-31 22:14:06,618 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2024-10-31 22:14:06,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 432 transitions, 901 flow [2024-10-31 22:14:06,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-10-31 22:14:06,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-10-31 22:14:06,622 INFO L175 Difference]: Start difference. First operand has 434 places, 433 transitions, 877 flow. Second operand 3 states and 1451 transitions. [2024-10-31 22:14:06,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 432 transitions, 901 flow [2024-10-31 22:14:06,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 432 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:14:06,630 INFO L231 Difference]: Finished difference. Result has 433 places, 432 transitions, 875 flow [2024-10-31 22:14:06,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=433, PETRI_TRANSITIONS=432} [2024-10-31 22:14:06,634 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -22 predicate places. [2024-10-31 22:14:06,635 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 432 transitions, 875 flow [2024-10-31 22:14:06,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:06,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:06,637 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:06,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:14:06,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:06,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:06,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1888702319, now seen corresponding path program 1 times [2024-10-31 22:14:06,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:06,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477875379] [2024-10-31 22:14:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:06,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:06,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:06,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477875379] [2024-10-31 22:14:06,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477875379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:06,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:06,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:06,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15605784] [2024-10-31 22:14:06,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:06,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:06,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:06,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:06,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-31 22:14:06,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 432 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:06,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:06,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-31 22:14:06,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:06,894 INFO L124 PetriNetUnfolderBase]: 15/547 cut-off events. [2024-10-31 22:14:06,894 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 22:14:06,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 547 events. 15/547 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1392 event pairs, 2 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 557. Up to 14 conditions per place. [2024-10-31 22:14:06,899 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2024-10-31 22:14:06,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 903 flow [2024-10-31 22:14:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1458 transitions. [2024-10-31 22:14:06,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9382239382239382 [2024-10-31 22:14:06,903 INFO L175 Difference]: Start difference. First operand has 433 places, 432 transitions, 875 flow. Second operand 3 states and 1458 transitions. [2024-10-31 22:14:06,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 903 flow [2024-10-31 22:14:06,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 432 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:14:06,911 INFO L231 Difference]: Finished difference. Result has 431 places, 430 transitions, 873 flow [2024-10-31 22:14:06,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=431, PETRI_TRANSITIONS=430} [2024-10-31 22:14:06,913 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -24 predicate places. [2024-10-31 22:14:06,913 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 430 transitions, 873 flow [2024-10-31 22:14:06,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:06,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:06,915 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:06,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:14:06,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:06,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:06,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1728199023, now seen corresponding path program 1 times [2024-10-31 22:14:06,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:06,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657226966] [2024-10-31 22:14:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:06,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:06,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657226966] [2024-10-31 22:14:06,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657226966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:06,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:06,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:06,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904064085] [2024-10-31 22:14:06,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:06,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:06,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:06,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:06,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-31 22:14:06,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 430 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:06,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:06,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-31 22:14:06,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:07,230 INFO L124 PetriNetUnfolderBase]: 31/1093 cut-off events. [2024-10-31 22:14:07,230 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-31 22:14:07,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 1093 events. 31/1093 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4659 event pairs, 2 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1137. Up to 46 conditions per place. [2024-10-31 22:14:07,243 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 16 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-10-31 22:14:07,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 435 transitions, 924 flow [2024-10-31 22:14:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-10-31 22:14:07,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-10-31 22:14:07,247 INFO L175 Difference]: Start difference. First operand has 431 places, 430 transitions, 873 flow. Second operand 3 states and 1463 transitions. [2024-10-31 22:14:07,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 435 transitions, 924 flow [2024-10-31 22:14:07,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 435 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:14:07,257 INFO L231 Difference]: Finished difference. Result has 430 places, 430 transitions, 877 flow [2024-10-31 22:14:07,258 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=430, PETRI_TRANSITIONS=430} [2024-10-31 22:14:07,259 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-10-31 22:14:07,259 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 430 transitions, 877 flow [2024-10-31 22:14:07,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:07,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:07,261 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:07,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:14:07,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:07,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:07,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1961587418, now seen corresponding path program 1 times [2024-10-31 22:14:07,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:07,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682821427] [2024-10-31 22:14:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:07,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:07,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:07,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682821427] [2024-10-31 22:14:07,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682821427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:07,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:07,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:07,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848442844] [2024-10-31 22:14:07,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:07,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:07,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:07,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:07,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:07,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-31 22:14:07,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 430 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:07,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:07,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-31 22:14:07,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:07,520 INFO L124 PetriNetUnfolderBase]: 25/750 cut-off events. [2024-10-31 22:14:07,521 INFO L125 PetriNetUnfolderBase]: For 12/33 co-relation queries the response was YES. [2024-10-31 22:14:07,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 750 events. 25/750 cut-off events. For 12/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2538 event pairs, 3 based on Foata normal form. 4/686 useless extension candidates. Maximal degree in co-relation 778. Up to 21 conditions per place. [2024-10-31 22:14:07,532 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 9 selfloop transitions, 2 changer transitions 4/430 dead transitions. [2024-10-31 22:14:07,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 430 transitions, 903 flow [2024-10-31 22:14:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-10-31 22:14:07,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-10-31 22:14:07,536 INFO L175 Difference]: Start difference. First operand has 430 places, 430 transitions, 877 flow. Second operand 3 states and 1457 transitions. [2024-10-31 22:14:07,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 430 transitions, 903 flow [2024-10-31 22:14:07,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 430 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:14:07,544 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 869 flow [2024-10-31 22:14:07,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2024-10-31 22:14:07,546 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-10-31 22:14:07,546 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 869 flow [2024-10-31 22:14:07,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:07,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:07,548 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:07,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:14:07,548 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:07,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 405174824, now seen corresponding path program 1 times [2024-10-31 22:14:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:07,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745842463] [2024-10-31 22:14:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:07,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:07,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745842463] [2024-10-31 22:14:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745842463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:07,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:07,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:07,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289391868] [2024-10-31 22:14:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:07,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:07,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:07,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:07,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-31 22:14:07,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:07,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:07,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-31 22:14:07,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:08,026 INFO L124 PetriNetUnfolderBase]: 73/1869 cut-off events. [2024-10-31 22:14:08,026 INFO L125 PetriNetUnfolderBase]: For 25/29 co-relation queries the response was YES. [2024-10-31 22:14:08,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 1869 events. 73/1869 cut-off events. For 25/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 11396 event pairs, 6 based on Foata normal form. 0/1674 useless extension candidates. Maximal degree in co-relation 1989. Up to 93 conditions per place. [2024-10-31 22:14:08,044 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 15 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2024-10-31 22:14:08,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 915 flow [2024-10-31 22:14:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2024-10-31 22:14:08,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9407979407979408 [2024-10-31 22:14:08,047 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 869 flow. Second operand 3 states and 1462 transitions. [2024-10-31 22:14:08,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 915 flow [2024-10-31 22:14:08,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:14:08,055 INFO L231 Difference]: Finished difference. Result has 425 places, 424 transitions, 875 flow [2024-10-31 22:14:08,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=425, PETRI_TRANSITIONS=424} [2024-10-31 22:14:08,056 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -30 predicate places. [2024-10-31 22:14:08,057 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 424 transitions, 875 flow [2024-10-31 22:14:08,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:08,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:08,058 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:08,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:14:08,059 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:08,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2061289579, now seen corresponding path program 1 times [2024-10-31 22:14:08,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:08,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25874891] [2024-10-31 22:14:08,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:08,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:08,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25874891] [2024-10-31 22:14:08,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25874891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:08,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:08,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:14:08,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103253238] [2024-10-31 22:14:08,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:08,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:14:08,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:08,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:14:08,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:14:08,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-10-31 22:14:08,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 424 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:08,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:08,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-10-31 22:14:08,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:09,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1415] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 83#L88true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 528#(= |#race~A~0| 0), Black: 533#true]) [2024-10-31 22:14:09,484 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2024-10-31 22:14:09,485 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-10-31 22:14:09,485 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-31 22:14:09,485 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-10-31 22:14:09,487 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1415] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 83#L88true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), Black: 533#true, 528#(= |#race~A~0| 0)]) [2024-10-31 22:14:09,487 INFO L294 olderBase$Statistics]: this new event has 308 ancestors and is not cut-off event [2024-10-31 22:14:09,488 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is not cut-off event [2024-10-31 22:14:09,488 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-10-31 22:14:09,488 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is not cut-off event [2024-10-31 22:14:09,488 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-10-31 22:14:09,533 INFO L124 PetriNetUnfolderBase]: 60/2025 cut-off events. [2024-10-31 22:14:09,534 INFO L125 PetriNetUnfolderBase]: For 13/62 co-relation queries the response was YES. [2024-10-31 22:14:09,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 2025 events. 60/2025 cut-off events. For 13/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10776 event pairs, 14 based on Foata normal form. 4/1859 useless extension candidates. Maximal degree in co-relation 2234. Up to 68 conditions per place. [2024-10-31 22:14:09,560 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/467 dead transitions. [2024-10-31 22:14:09,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 467 transitions, 1133 flow [2024-10-31 22:14:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:14:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-31 22:14:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-10-31 22:14:09,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-10-31 22:14:09,587 INFO L175 Difference]: Start difference. First operand has 425 places, 424 transitions, 875 flow. Second operand 10 states and 4633 transitions. [2024-10-31 22:14:09,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 467 transitions, 1133 flow [2024-10-31 22:14:09,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 467 transitions, 1133 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:14:09,613 INFO L231 Difference]: Finished difference. Result has 438 places, 449 transitions, 1067 flow [2024-10-31 22:14:09,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1067, PETRI_PLACES=438, PETRI_TRANSITIONS=449} [2024-10-31 22:14:09,614 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-10-31 22:14:09,615 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 449 transitions, 1067 flow [2024-10-31 22:14:09,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:09,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:09,621 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:09,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:14:09,622 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:09,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:09,623 INFO L85 PathProgramCache]: Analyzing trace with hash -472792529, now seen corresponding path program 1 times [2024-10-31 22:14:09,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:09,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383151889] [2024-10-31 22:14:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:09,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:09,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:09,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383151889] [2024-10-31 22:14:09,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383151889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:09,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:09,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:09,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613480909] [2024-10-31 22:14:09,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:09,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:09,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:09,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:09,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:09,734 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-31 22:14:09,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 449 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:09,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:09,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-31 22:14:09,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:10,335 INFO L124 PetriNetUnfolderBase]: 102/2072 cut-off events. [2024-10-31 22:14:10,335 INFO L125 PetriNetUnfolderBase]: For 80/90 co-relation queries the response was YES. [2024-10-31 22:14:10,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 2072 events. 102/2072 cut-off events. For 80/90 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11374 event pairs, 2 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 2365. Up to 124 conditions per place. [2024-10-31 22:14:10,361 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 14 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2024-10-31 22:14:10,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 451 transitions, 1104 flow [2024-10-31 22:14:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2024-10-31 22:14:10,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9395109395109396 [2024-10-31 22:14:10,365 INFO L175 Difference]: Start difference. First operand has 438 places, 449 transitions, 1067 flow. Second operand 3 states and 1460 transitions. [2024-10-31 22:14:10,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 451 transitions, 1104 flow [2024-10-31 22:14:10,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 451 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:14:10,373 INFO L231 Difference]: Finished difference. Result has 439 places, 448 transitions, 1070 flow [2024-10-31 22:14:10,374 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=439, PETRI_TRANSITIONS=448} [2024-10-31 22:14:10,375 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-10-31 22:14:10,375 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 448 transitions, 1070 flow [2024-10-31 22:14:10,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:10,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:10,377 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:10,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:14:10,377 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:10,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:10,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1592361780, now seen corresponding path program 1 times [2024-10-31 22:14:10,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:10,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039085720] [2024-10-31 22:14:10,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:10,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:10,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:10,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039085720] [2024-10-31 22:14:10,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039085720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:10,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:10,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:14:10,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986320299] [2024-10-31 22:14:10,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:10,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:14:10,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:10,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:14:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:14:11,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-10-31 22:14:11,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 448 transitions, 1070 flow. Second operand has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:11,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:11,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-10-31 22:14:11,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:11,622 INFO L124 PetriNetUnfolderBase]: 73/1499 cut-off events. [2024-10-31 22:14:11,622 INFO L125 PetriNetUnfolderBase]: For 103/173 co-relation queries the response was YES. [2024-10-31 22:14:11,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1499 events. 73/1499 cut-off events. For 103/173 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7142 event pairs, 28 based on Foata normal form. 4/1396 useless extension candidates. Maximal degree in co-relation 1803. Up to 99 conditions per place. [2024-10-31 22:14:11,641 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/468 dead transitions. [2024-10-31 22:14:11,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 468 transitions, 1302 flow [2024-10-31 22:14:11,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:14:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-31 22:14:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-10-31 22:14:11,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-10-31 22:14:11,651 INFO L175 Difference]: Start difference. First operand has 439 places, 448 transitions, 1070 flow. Second operand 10 states and 4633 transitions. [2024-10-31 22:14:11,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 468 transitions, 1302 flow [2024-10-31 22:14:11,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 468 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:14:11,663 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 1175 flow [2024-10-31 22:14:11,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1175, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2024-10-31 22:14:11,665 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-10-31 22:14:11,665 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 1175 flow [2024-10-31 22:14:11,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:11,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:11,668 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:11,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:14:11,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:11,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 357189461, now seen corresponding path program 1 times [2024-10-31 22:14:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:11,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896715195] [2024-10-31 22:14:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896715195] [2024-10-31 22:14:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896715195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:11,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:11,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:14:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260419082] [2024-10-31 22:14:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:11,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:14:11,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:11,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:14:11,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:14:12,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-10-31 22:14:12,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 1175 flow. Second operand has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:12,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:12,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-10-31 22:14:12,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:13,050 INFO L124 PetriNetUnfolderBase]: 72/1494 cut-off events. [2024-10-31 22:14:13,050 INFO L125 PetriNetUnfolderBase]: For 169/176 co-relation queries the response was YES. [2024-10-31 22:14:13,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1494 events. 72/1494 cut-off events. For 169/176 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6960 event pairs, 29 based on Foata normal form. 3/1401 useless extension candidates. Maximal degree in co-relation 1837. Up to 98 conditions per place. [2024-10-31 22:14:13,067 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/470 dead transitions. [2024-10-31 22:14:13,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 470 transitions, 1407 flow [2024-10-31 22:14:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:14:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-31 22:14:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-10-31 22:14:13,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-10-31 22:14:13,077 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 1175 flow. Second operand 10 states and 4633 transitions. [2024-10-31 22:14:13,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 470 transitions, 1407 flow [2024-10-31 22:14:13,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 470 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-31 22:14:13,089 INFO L231 Difference]: Finished difference. Result has 454 places, 452 transitions, 1207 flow [2024-10-31 22:14:13,089 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1207, PETRI_PLACES=454, PETRI_TRANSITIONS=452} [2024-10-31 22:14:13,091 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -1 predicate places. [2024-10-31 22:14:13,091 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 452 transitions, 1207 flow [2024-10-31 22:14:13,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:13,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:13,093 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:13,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:14:13,094 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:13,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:13,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1454371584, now seen corresponding path program 1 times [2024-10-31 22:14:13,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148115706] [2024-10-31 22:14:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148115706] [2024-10-31 22:14:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148115706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:13,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:13,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043666239] [2024-10-31 22:14:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:13,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:13,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:13,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:13,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:13,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-10-31 22:14:13,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 452 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:13,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:13,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-10-31 22:14:13,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:13,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L68-->L68-1: Formula: (= |v_#race~csum~0_4| 0) InVars {} OutVars{#race~csum~0=|v_#race~csum~0_4|} AuxVars[] AssignedVars[#race~csum~0][403], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 302#L68-1true, 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 602#(= |#race~csum~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 282#L87true, 528#(= |#race~A~0| 0), Black: 533#true, 581#true, 562#true]) [2024-10-31 22:14:13,572 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-10-31 22:14:13,572 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-10-31 22:14:13,573 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-10-31 22:14:13,573 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-10-31 22:14:13,610 INFO L124 PetriNetUnfolderBase]: 48/1185 cut-off events. [2024-10-31 22:14:13,610 INFO L125 PetriNetUnfolderBase]: For 94/98 co-relation queries the response was YES. [2024-10-31 22:14:13,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1185 events. 48/1185 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4399 event pairs, 3 based on Foata normal form. 6/1127 useless extension candidates. Maximal degree in co-relation 1423. Up to 37 conditions per place. [2024-10-31 22:14:13,624 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 8 selfloop transitions, 2 changer transitions 28/452 dead transitions. [2024-10-31 22:14:13,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1233 flow [2024-10-31 22:14:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:14:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-10-31 22:14:13,628 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-10-31 22:14:13,628 INFO L175 Difference]: Start difference. First operand has 454 places, 452 transitions, 1207 flow. Second operand 3 states and 1457 transitions. [2024-10-31 22:14:13,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1233 flow [2024-10-31 22:14:13,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 452 transitions, 1160 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-31 22:14:13,638 INFO L231 Difference]: Finished difference. Result has 447 places, 422 transitions, 975 flow [2024-10-31 22:14:13,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=447, PETRI_TRANSITIONS=422} [2024-10-31 22:14:13,640 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-10-31 22:14:13,640 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 422 transitions, 975 flow [2024-10-31 22:14:13,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:13,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:13,641 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:13,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:14:13,641 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:13,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash -728454956, now seen corresponding path program 1 times [2024-10-31 22:14:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:13,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522045672] [2024-10-31 22:14:13,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:14:14,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:14,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522045672] [2024-10-31 22:14:14,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522045672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:14,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:14,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072829367] [2024-10-31 22:14:14,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:14,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:14:14,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:14,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:14:14,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:15,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-31 22:14:15,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 422 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:15,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:15,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-31 22:14:15,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:15,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 603#true, Black: 586#(<= ~N~0 0), 282#L87true, 507#(= |#race~N~0| 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 39#L67-27true, 528#(= |#race~A~0| 0), Black: 533#true, 562#true]) [2024-10-31 22:14:15,994 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2024-10-31 22:14:15,995 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-31 22:14:15,995 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-31 22:14:15,995 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-31 22:14:16,311 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 603#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 282#L87true, 507#(= |#race~N~0| 0), 39#L67-27true, Black: 533#true, 528#(= |#race~A~0| 0), 562#true]) [2024-10-31 22:14:16,311 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-10-31 22:14:16,311 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-10-31 22:14:16,311 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-31 22:14:16,311 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-31 22:14:16,312 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-31 22:14:16,345 INFO L124 PetriNetUnfolderBase]: 203/3554 cut-off events. [2024-10-31 22:14:16,346 INFO L125 PetriNetUnfolderBase]: For 56/77 co-relation queries the response was YES. [2024-10-31 22:14:16,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 3554 events. 203/3554 cut-off events. For 56/77 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 25936 event pairs, 44 based on Foata normal form. 4/3276 useless extension candidates. Maximal degree in co-relation 4196. Up to 292 conditions per place. [2024-10-31 22:14:16,409 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 39 selfloop transitions, 22 changer transitions 0/451 dead transitions. [2024-10-31 22:14:16,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 451 transitions, 1163 flow [2024-10-31 22:14:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:14:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:14:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-10-31 22:14:16,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-10-31 22:14:16,415 INFO L175 Difference]: Start difference. First operand has 447 places, 422 transitions, 975 flow. Second operand 6 states and 2828 transitions. [2024-10-31 22:14:16,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 451 transitions, 1163 flow [2024-10-31 22:14:16,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 451 transitions, 1087 flow, removed 14 selfloop flow, removed 15 redundant places. [2024-10-31 22:14:16,427 INFO L231 Difference]: Finished difference. Result has 434 places, 443 transitions, 1049 flow [2024-10-31 22:14:16,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=443} [2024-10-31 22:14:16,431 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-10-31 22:14:16,432 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 443 transitions, 1049 flow [2024-10-31 22:14:16,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:16,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:16,437 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:16,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:14:16,438 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:16,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2090320587, now seen corresponding path program 1 times [2024-10-31 22:14:16,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:16,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43520042] [2024-10-31 22:14:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:16,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:14:17,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:17,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43520042] [2024-10-31 22:14:17,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43520042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:17,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:17,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:17,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096028624] [2024-10-31 22:14:17,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:17,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:14:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:17,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:14:17,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:17,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-31 22:14:17,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 443 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:17,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:17,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-31 22:14:17,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:14:20,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-2-->L59-3: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][286], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 560#(= |#race~C~0| 0), 308#L86-1true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 558#true, Black: 526#true, 603#true, 85#L67-11true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 202#L59-3true]) [2024-10-31 22:14:20,192 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-10-31 22:14:20,192 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-31 22:14:20,192 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-10-31 22:14:20,192 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-10-31 22:14:20,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, 308#L86-1true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 145#L62true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 526#true, Black: 558#true, 603#true, 507#(= |#race~N~0| 0), 39#L67-27true, Black: 533#true, 528#(= |#race~A~0| 0)]) [2024-10-31 22:14:20,878 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2024-10-31 22:14:20,878 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-31 22:14:20,878 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-10-31 22:14:20,878 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-10-31 22:14:20,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 558#true, Black: 526#true, 603#true, 507#(= |#race~N~0| 0), 282#L87true, 39#L67-27true, 528#(= |#race~A~0| 0), Black: 533#true]) [2024-10-31 22:14:20,937 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-10-31 22:14:20,937 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-31 22:14:20,937 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-31 22:14:20,937 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-10-31 22:14:21,219 INFO L124 PetriNetUnfolderBase]: 1328/14868 cut-off events. [2024-10-31 22:14:21,219 INFO L125 PetriNetUnfolderBase]: For 1656/1738 co-relation queries the response was YES. [2024-10-31 22:14:21,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18895 conditions, 14868 events. 1328/14868 cut-off events. For 1656/1738 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 171997 event pairs, 205 based on Foata normal form. 0/13463 useless extension candidates. Maximal degree in co-relation 18855. Up to 1392 conditions per place. [2024-10-31 22:14:21,404 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 55 selfloop transitions, 86 changer transitions 0/536 dead transitions. [2024-10-31 22:14:21,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 536 transitions, 1813 flow [2024-10-31 22:14:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:14:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:14:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-10-31 22:14:21,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-10-31 22:14:21,410 INFO L175 Difference]: Start difference. First operand has 434 places, 443 transitions, 1049 flow. Second operand 6 states and 2828 transitions. [2024-10-31 22:14:21,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 536 transitions, 1813 flow [2024-10-31 22:14:21,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 536 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:14:21,429 INFO L231 Difference]: Finished difference. Result has 444 places, 528 transitions, 1903 flow [2024-10-31 22:14:21,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1903, PETRI_PLACES=444, PETRI_TRANSITIONS=528} [2024-10-31 22:14:21,431 INFO L277 CegarLoopForPetriNet]: 455 programPoint places, -11 predicate places. [2024-10-31 22:14:21,431 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 528 transitions, 1903 flow [2024-10-31 22:14:21,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:21,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:14:21,434 INFO L204 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:21,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:14:21,435 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-31 22:14:21,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1264112148, now seen corresponding path program 1 times [2024-10-31 22:14:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375153296] [2024-10-31 22:14:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:14:22,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:22,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375153296] [2024-10-31 22:14:22,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375153296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:22,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:22,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:14:22,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808972196] [2024-10-31 22:14:22,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:22,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:14:22,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:22,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:14:22,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:14:22,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-10-31 22:14:22,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 528 transitions, 1903 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:22,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:14:22,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-10-31 22:14:22,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand