./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-parray-copy.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_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/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_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/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_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/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 7aea5f8d9182df5a5d01671c1aa4ef829b038428d2f68272ec4ea6e120e3973d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:59:18,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:59:18,627 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 21:59:18,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:59:18,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:59:18,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:59:18,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:59:18,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:59:18,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:59:18,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:59:18,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:59:18,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:59:18,683 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:59:18,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:59:18,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:59:18,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:59:18,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:59:18,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:59:18,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:59:18,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:59:18,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:59:18,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:59:18,692 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 21:59:18,692 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:59:18,692 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:59:18,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:59:18,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:59:18,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:59:18,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:59:18,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:59:18,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:59:18,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:18,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:59:18,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:59:18,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:59:18,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:59:18,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:59:18,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:59:18,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:59:18,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:59:18,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:59:18,718 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_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/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_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/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 -> 7aea5f8d9182df5a5d01671c1aa4ef829b038428d2f68272ec4ea6e120e3973d [2024-10-31 21:59:19,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:59:19,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:59:19,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:59:19,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:59:19,102 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:59:19,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c Unable to find full path for "g++" [2024-10-31 21:59:21,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:59:21,576 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:59:21,578 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c [2024-10-31 21:59:21,592 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/bin/uautomizer-verify-4GaUIPS5ZU/data/8183cef27/3bd9928d0b82404aa480103085b260ba/FLAG0adbcf95e [2024-10-31 21:59:21,612 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/bin/uautomizer-verify-4GaUIPS5ZU/data/8183cef27/3bd9928d0b82404aa480103085b260ba [2024-10-31 21:59:21,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:59:21,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:59:21,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:21,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:59:21,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:59:21,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:21,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63af23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21, skipping insertion in model container [2024-10-31 21:59:21,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:21,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:59:21,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:21,919 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:59:21,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:21,972 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:59:21,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21 WrapperNode [2024-10-31 21:59:21,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:21,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:21,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:59:21,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:59:21,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,042 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 193 [2024-10-31 21:59:22,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:22,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:59:22,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:59:22,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:59:22,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:59:22,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:59:22,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:59:22,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:59:22,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (1/1) ... [2024-10-31 21:59:22,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:22,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:22,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:59:22,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4770d9-86be-4ce4-86a9-e4afc23a3d00/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:59:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:59:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 21:59:22,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 21:59:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 21:59:22,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 21:59:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-31 21:59:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-31 21:59:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 21:59:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 21:59:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 21:59:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:59:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:59:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 21:59:22,193 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 21:59:22,320 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:59:22,323 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:59:23,093 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 21:59:23,093 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:59:23,122 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:59:23,123 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-31 21:59:23,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:23 BoogieIcfgContainer [2024-10-31 21:59:23,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:59:23,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:59:23,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:59:23,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:59:23,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:59:21" (1/3) ... [2024-10-31 21:59:23,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151e1508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:23, skipping insertion in model container [2024-10-31 21:59:23,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:21" (2/3) ... [2024-10-31 21:59:23,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151e1508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:23, skipping insertion in model container [2024-10-31 21:59:23,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:23" (3/3) ... [2024-10-31 21:59:23,139 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-parray-copy.wvr.c [2024-10-31 21:59:23,162 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:59:23,163 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-10-31 21:59:23,164 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 21:59:23,412 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-31 21:59:23,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 356 places, 365 transitions, 751 flow [2024-10-31 21:59:23,720 INFO L124 PetriNetUnfolderBase]: 19/362 cut-off events. [2024-10-31 21:59:23,722 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 21:59:23,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 362 events. 19/362 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 510 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 262. Up to 2 conditions per place. [2024-10-31 21:59:23,739 INFO L82 GeneralOperation]: Start removeDead. Operand has 356 places, 365 transitions, 751 flow [2024-10-31 21:59:23,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 343 transitions, 704 flow [2024-10-31 21:59:23,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:59:23,787 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;@599f49f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:59:23,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-10-31 21:59:23,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:59:23,798 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2024-10-31 21:59:23,798 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:59:23,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:23,800 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] [2024-10-31 21:59:23,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:23,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash -797155038, now seen corresponding path program 1 times [2024-10-31 21:59:23,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:23,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306400520] [2024-10-31 21:59:23,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:24,061 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 21:59:24,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:24,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306400520] [2024-10-31 21:59:24,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306400520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:24,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:24,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:24,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510576375] [2024-10-31 21:59:24,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:24,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:24,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:24,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 365 [2024-10-31 21:59:24,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 343 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 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 21:59:24,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:24,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 365 [2024-10-31 21:59:24,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:24,447 INFO L124 PetriNetUnfolderBase]: 21/558 cut-off events. [2024-10-31 21:59:24,448 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-10-31 21:59:24,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 558 events. 21/558 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1876 event pairs, 7 based on Foata normal form. 20/493 useless extension candidates. Maximal degree in co-relation 335. Up to 31 conditions per place. [2024-10-31 21:59:24,457 INFO L140 encePairwiseOnDemand]: 351/365 looper letters, 13 selfloop transitions, 2 changer transitions 6/331 dead transitions. [2024-10-31 21:59:24,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 331 transitions, 710 flow [2024-10-31 21:59:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1032 transitions. [2024-10-31 21:59:24,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9424657534246575 [2024-10-31 21:59:24,487 INFO L175 Difference]: Start difference. First operand has 335 places, 343 transitions, 704 flow. Second operand 3 states and 1032 transitions. [2024-10-31 21:59:24,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 331 transitions, 710 flow [2024-10-31 21:59:24,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 331 transitions, 698 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-31 21:59:24,504 INFO L231 Difference]: Finished difference. Result has 330 places, 325 transitions, 660 flow [2024-10-31 21:59:24,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=330, PETRI_TRANSITIONS=325} [2024-10-31 21:59:24,512 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -5 predicate places. [2024-10-31 21:59:24,513 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 325 transitions, 660 flow [2024-10-31 21:59:24,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 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 21:59:24,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:24,515 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] [2024-10-31 21:59:24,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:59:24,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:24,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash 18312663, now seen corresponding path program 1 times [2024-10-31 21:59:24,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:24,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765148931] [2024-10-31 21:59:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:24,597 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 21:59:24,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:24,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765148931] [2024-10-31 21:59:24,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765148931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:24,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:24,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:24,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431907524] [2024-10-31 21:59:24,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:24,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:24,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:24,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:24,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:24,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 365 [2024-10-31 21:59:24,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 325 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 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 21:59:24,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:24,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 365 [2024-10-31 21:59:24,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:24,809 INFO L124 PetriNetUnfolderBase]: 15/436 cut-off events. [2024-10-31 21:59:24,810 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 21:59:24,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 436 events. 15/436 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1181 event pairs, 5 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 447. Up to 29 conditions per place. [2024-10-31 21:59:24,816 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 15 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2024-10-31 21:59:24,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 324 transitions, 692 flow [2024-10-31 21:59:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2024-10-31 21:59:24,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9287671232876712 [2024-10-31 21:59:24,820 INFO L175 Difference]: Start difference. First operand has 330 places, 325 transitions, 660 flow. Second operand 3 states and 1017 transitions. [2024-10-31 21:59:24,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 324 transitions, 692 flow [2024-10-31 21:59:24,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 324 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:24,832 INFO L231 Difference]: Finished difference. Result has 323 places, 324 transitions, 658 flow [2024-10-31 21:59:24,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=323, PETRI_TRANSITIONS=324} [2024-10-31 21:59:24,833 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -12 predicate places. [2024-10-31 21:59:24,834 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 324 transitions, 658 flow [2024-10-31 21:59:24,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 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 21:59:24,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:24,835 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] [2024-10-31 21:59:24,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:59:24,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:24,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:24,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1431681564, now seen corresponding path program 1 times [2024-10-31 21:59:24,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:24,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114831325] [2024-10-31 21:59:24,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:24,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:24,924 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 21:59:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114831325] [2024-10-31 21:59:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114831325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:24,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:24,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582752526] [2024-10-31 21:59:24,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:24,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:24,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:24,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:24,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 365 [2024-10-31 21:59:24,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 324 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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 21:59:24,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:24,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 365 [2024-10-31 21:59:24,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:25,124 INFO L124 PetriNetUnfolderBase]: 27/536 cut-off events. [2024-10-31 21:59:25,124 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-31 21:59:25,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 536 events. 27/536 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1884 event pairs, 12 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 562. Up to 50 conditions per place. [2024-10-31 21:59:25,131 INFO L140 encePairwiseOnDemand]: 358/365 looper letters, 18 selfloop transitions, 1 changer transitions 0/318 dead transitions. [2024-10-31 21:59:25,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 318 transitions, 684 flow [2024-10-31 21:59:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2024-10-31 21:59:25,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9187214611872146 [2024-10-31 21:59:25,135 INFO L175 Difference]: Start difference. First operand has 323 places, 324 transitions, 658 flow. Second operand 3 states and 1006 transitions. [2024-10-31 21:59:25,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 318 transitions, 684 flow [2024-10-31 21:59:25,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:25,141 INFO L231 Difference]: Finished difference. Result has 317 places, 318 transitions, 644 flow [2024-10-31 21:59:25,142 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=317, PETRI_TRANSITIONS=318} [2024-10-31 21:59:25,143 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -18 predicate places. [2024-10-31 21:59:25,143 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 318 transitions, 644 flow [2024-10-31 21:59:25,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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 21:59:25,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:25,145 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] [2024-10-31 21:59:25,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:59:25,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:25,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1787824514, now seen corresponding path program 1 times [2024-10-31 21:59:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:25,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241226663] [2024-10-31 21:59:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:26,028 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 21:59:26,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:26,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241226663] [2024-10-31 21:59:26,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241226663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:26,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:26,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873440738] [2024-10-31 21:59:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:26,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:26,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:26,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:26,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:26,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 365 [2024-10-31 21:59:26,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 318 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 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 21:59:26,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:26,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 365 [2024-10-31 21:59:26,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:28,073 INFO L124 PetriNetUnfolderBase]: 1896/6905 cut-off events. [2024-10-31 21:59:28,074 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-10-31 21:59:28,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9829 conditions, 6905 events. 1896/6905 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 67562 event pairs, 1520 based on Foata normal form. 0/5777 useless extension candidates. Maximal degree in co-relation 9793. Up to 2820 conditions per place. [2024-10-31 21:59:28,159 INFO L140 encePairwiseOnDemand]: 353/365 looper letters, 54 selfloop transitions, 10 changer transitions 0/316 dead transitions. [2024-10-31 21:59:28,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 316 transitions, 768 flow [2024-10-31 21:59:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:59:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1782 transitions. [2024-10-31 21:59:28,166 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8136986301369863 [2024-10-31 21:59:28,166 INFO L175 Difference]: Start difference. First operand has 317 places, 318 transitions, 644 flow. Second operand 6 states and 1782 transitions. [2024-10-31 21:59:28,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 316 transitions, 768 flow [2024-10-31 21:59:28,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 767 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:59:28,175 INFO L231 Difference]: Finished difference. Result has 319 places, 316 transitions, 659 flow [2024-10-31 21:59:28,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=659, PETRI_PLACES=319, PETRI_TRANSITIONS=316} [2024-10-31 21:59:28,176 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -16 predicate places. [2024-10-31 21:59:28,177 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 316 transitions, 659 flow [2024-10-31 21:59:28,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 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 21:59:28,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:28,179 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] [2024-10-31 21:59:28,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:59:28,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:28,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2045834353, now seen corresponding path program 1 times [2024-10-31 21:59:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:28,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143279352] [2024-10-31 21:59:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:28,229 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 21:59:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143279352] [2024-10-31 21:59:28,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143279352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:28,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:28,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921598464] [2024-10-31 21:59:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:28,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:28,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:28,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:28,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:28,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 365 [2024-10-31 21:59:28,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 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 21:59:28,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:28,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 365 [2024-10-31 21:59:28,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:28,369 INFO L124 PetriNetUnfolderBase]: 26/499 cut-off events. [2024-10-31 21:59:28,369 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 21:59:28,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 499 events. 26/499 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1709 event pairs, 15 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 529. Up to 41 conditions per place. [2024-10-31 21:59:28,374 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 13 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2024-10-31 21:59:28,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 315 transitions, 687 flow [2024-10-31 21:59:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions. [2024-10-31 21:59:28,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9324200913242009 [2024-10-31 21:59:28,378 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 659 flow. Second operand 3 states and 1021 transitions. [2024-10-31 21:59:28,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 315 transitions, 687 flow [2024-10-31 21:59:28,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 315 transitions, 667 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 21:59:28,385 INFO L231 Difference]: Finished difference. Result has 315 places, 315 transitions, 641 flow [2024-10-31 21:59:28,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=315, PETRI_TRANSITIONS=315} [2024-10-31 21:59:28,388 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -20 predicate places. [2024-10-31 21:59:28,389 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 315 transitions, 641 flow [2024-10-31 21:59:28,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 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 21:59:28,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:28,391 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] [2024-10-31 21:59:28,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:59:28,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:28,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash 75872876, now seen corresponding path program 1 times [2024-10-31 21:59:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:28,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556864036] [2024-10-31 21:59:28,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:28,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:28,517 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 21:59:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556864036] [2024-10-31 21:59:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556864036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:28,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:28,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:28,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682710569] [2024-10-31 21:59:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:28,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:28,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:28,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:28,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 365 [2024-10-31 21:59:28,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 315 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 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 21:59:28,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:28,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 365 [2024-10-31 21:59:28,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:28,744 INFO L124 PetriNetUnfolderBase]: 40/652 cut-off events. [2024-10-31 21:59:28,744 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2024-10-31 21:59:28,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 652 events. 40/652 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2740 event pairs, 15 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 688. Up to 59 conditions per place. [2024-10-31 21:59:28,752 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 13 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2024-10-31 21:59:28,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 314 transitions, 669 flow [2024-10-31 21:59:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions. [2024-10-31 21:59:28,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9324200913242009 [2024-10-31 21:59:28,755 INFO L175 Difference]: Start difference. First operand has 315 places, 315 transitions, 641 flow. Second operand 3 states and 1021 transitions. [2024-10-31 21:59:28,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 314 transitions, 669 flow [2024-10-31 21:59:28,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 314 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:28,761 INFO L231 Difference]: Finished difference. Result has 314 places, 314 transitions, 639 flow [2024-10-31 21:59:28,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=314, PETRI_TRANSITIONS=314} [2024-10-31 21:59:28,762 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -21 predicate places. [2024-10-31 21:59:28,763 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 314 transitions, 639 flow [2024-10-31 21:59:28,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 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 21:59:28,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:28,764 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] [2024-10-31 21:59:28,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:59:28,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:28,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:28,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2116388653, now seen corresponding path program 1 times [2024-10-31 21:59:28,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:28,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929985471] [2024-10-31 21:59:28,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:28,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:28,834 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 21:59:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:28,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929985471] [2024-10-31 21:59:28,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929985471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:28,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:28,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403553341] [2024-10-31 21:59:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:28,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:28,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:28,868 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 365 [2024-10-31 21:59:28,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 314 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 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 21:59:28,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:28,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 365 [2024-10-31 21:59:28,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:28,980 INFO L124 PetriNetUnfolderBase]: 39/649 cut-off events. [2024-10-31 21:59:28,981 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-31 21:59:28,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 649 events. 39/649 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2782 event pairs, 20 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 680. Up to 56 conditions per place. [2024-10-31 21:59:28,988 INFO L140 encePairwiseOnDemand]: 360/365 looper letters, 14 selfloop transitions, 1 changer transitions 0/310 dead transitions. [2024-10-31 21:59:28,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 661 flow [2024-10-31 21:59:28,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2024-10-31 21:59:28,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9296803652968036 [2024-10-31 21:59:28,992 INFO L175 Difference]: Start difference. First operand has 314 places, 314 transitions, 639 flow. Second operand 3 states and 1018 transitions. [2024-10-31 21:59:28,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 661 flow [2024-10-31 21:59:28,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 310 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:28,998 INFO L231 Difference]: Finished difference. Result has 310 places, 310 transitions, 629 flow [2024-10-31 21:59:28,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=310, PETRI_TRANSITIONS=310} [2024-10-31 21:59:29,000 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -25 predicate places. [2024-10-31 21:59:29,000 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 310 transitions, 629 flow [2024-10-31 21:59:29,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 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 21:59:29,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:29,002 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] [2024-10-31 21:59:29,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:59:29,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:29,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:29,004 INFO L85 PathProgramCache]: Analyzing trace with hash 624653984, now seen corresponding path program 1 times [2024-10-31 21:59:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:29,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151774876] [2024-10-31 21:59:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:29,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:29,081 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 21:59:29,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:29,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151774876] [2024-10-31 21:59:29,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151774876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:29,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:29,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:29,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826200593] [2024-10-31 21:59:29,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:29,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:29,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:29,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:29,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:29,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 365 [2024-10-31 21:59:29,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 310 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 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 21:59:29,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:29,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 365 [2024-10-31 21:59:29,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:29,378 INFO L124 PetriNetUnfolderBase]: 118/1290 cut-off events. [2024-10-31 21:59:29,378 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-31 21:59:29,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 1290 events. 118/1290 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 8450 event pairs, 22 based on Foata normal form. 0/1139 useless extension candidates. Maximal degree in co-relation 1443. Up to 164 conditions per place. [2024-10-31 21:59:29,397 INFO L140 encePairwiseOnDemand]: 357/365 looper letters, 20 selfloop transitions, 4 changer transitions 0/315 dead transitions. [2024-10-31 21:59:29,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 315 transitions, 692 flow [2024-10-31 21:59:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1027 transitions. [2024-10-31 21:59:29,401 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9378995433789954 [2024-10-31 21:59:29,402 INFO L175 Difference]: Start difference. First operand has 310 places, 310 transitions, 629 flow. Second operand 3 states and 1027 transitions. [2024-10-31 21:59:29,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 315 transitions, 692 flow [2024-10-31 21:59:29,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 315 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:59:29,410 INFO L231 Difference]: Finished difference. Result has 308 places, 310 transitions, 648 flow [2024-10-31 21:59:29,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=308, PETRI_TRANSITIONS=310} [2024-10-31 21:59:29,411 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -27 predicate places. [2024-10-31 21:59:29,412 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 310 transitions, 648 flow [2024-10-31 21:59:29,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 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 21:59:29,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:29,413 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] [2024-10-31 21:59:29,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:59:29,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:29,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1002915486, now seen corresponding path program 1 times [2024-10-31 21:59:29,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:29,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366220793] [2024-10-31 21:59:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:29,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:29,471 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 21:59:29,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:29,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366220793] [2024-10-31 21:59:29,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366220793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:29,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:29,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947425466] [2024-10-31 21:59:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:29,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:29,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 365 [2024-10-31 21:59:29,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 310 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 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 21:59:29,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:29,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 365 [2024-10-31 21:59:29,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:29,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([898] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][220], [75#L48-3true, 139#L64-1true, Black: 383#true, 382#(= |#race~M~0| 0), 247#L84-4true, 389#(= |#race~A~0| 0), 385#(= |#race~B~0| 0), 242#L56-1true, 367#(= |#race~N~0| 0)]) [2024-10-31 21:59:29,790 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2024-10-31 21:59:29,791 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-31 21:59:29,791 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2024-10-31 21:59:29,791 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-31 21:59:29,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([898] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][220], [139#L64-1true, Black: 383#true, 382#(= |#race~M~0| 0), 247#L84-4true, 389#(= |#race~A~0| 0), 145#L48-4true, 385#(= |#race~B~0| 0), 242#L56-1true, 367#(= |#race~N~0| 0)]) [2024-10-31 21:59:29,792 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2024-10-31 21:59:29,792 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-10-31 21:59:29,792 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-10-31 21:59:29,792 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-10-31 21:59:29,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([898] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][220], [139#L64-1true, Black: 383#true, 382#(= |#race~M~0| 0), 389#(= |#race~A~0| 0), 385#(= |#race~B~0| 0), 242#L56-1true, 367#(= |#race~N~0| 0), 54#L85-1true]) [2024-10-31 21:59:29,799 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-31 21:59:29,799 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-10-31 21:59:29,799 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-31 21:59:29,799 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-10-31 21:59:29,800 INFO L124 PetriNetUnfolderBase]: 190/1657 cut-off events. [2024-10-31 21:59:29,800 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-31 21:59:29,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 1657 events. 190/1657 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11424 event pairs, 38 based on Foata normal form. 0/1476 useless extension candidates. Maximal degree in co-relation 1948. Up to 206 conditions per place. [2024-10-31 21:59:29,816 INFO L140 encePairwiseOnDemand]: 357/365 looper letters, 20 selfloop transitions, 4 changer transitions 0/315 dead transitions. [2024-10-31 21:59:29,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 315 transitions, 711 flow [2024-10-31 21:59:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1027 transitions. [2024-10-31 21:59:29,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9378995433789954 [2024-10-31 21:59:29,820 INFO L175 Difference]: Start difference. First operand has 308 places, 310 transitions, 648 flow. Second operand 3 states and 1027 transitions. [2024-10-31 21:59:29,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 315 transitions, 711 flow [2024-10-31 21:59:29,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 315 transitions, 711 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:29,825 INFO L231 Difference]: Finished difference. Result has 307 places, 310 transitions, 668 flow [2024-10-31 21:59:29,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=307, PETRI_TRANSITIONS=310} [2024-10-31 21:59:29,827 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -28 predicate places. [2024-10-31 21:59:29,827 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 310 transitions, 668 flow [2024-10-31 21:59:29,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 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 21:59:29,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:29,830 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] [2024-10-31 21:59:29,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:59:29,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:29,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1113857350, now seen corresponding path program 1 times [2024-10-31 21:59:29,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:29,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86886258] [2024-10-31 21:59:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:30,075 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 21:59:30,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:30,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86886258] [2024-10-31 21:59:30,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86886258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:30,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:30,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624875667] [2024-10-31 21:59:30,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:30,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:30,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:30,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:30,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:30,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 365 [2024-10-31 21:59:30,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 310 transitions, 668 flow. Second operand has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 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 21:59:30,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:30,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 365 [2024-10-31 21:59:30,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:30,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([932] thread3EXIT-->L87: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][325], [Black: 383#true, 382#(= |#race~M~0| 0), 61#L87true, 391#true, Black: 387#true, 385#(= |#race~B~0| 0), 389#(= |#race~A~0| 0), 367#(= |#race~N~0| 0)]) [2024-10-31 21:59:30,919 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2024-10-31 21:59:30,919 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-10-31 21:59:30,920 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-10-31 21:59:30,920 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2024-10-31 21:59:30,920 INFO L124 PetriNetUnfolderBase]: 129/1581 cut-off events. [2024-10-31 21:59:30,920 INFO L125 PetriNetUnfolderBase]: For 14/35 co-relation queries the response was YES. [2024-10-31 21:59:30,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 1581 events. 129/1581 cut-off events. For 14/35 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9623 event pairs, 28 based on Foata normal form. 4/1475 useless extension candidates. Maximal degree in co-relation 1917. Up to 97 conditions per place. [2024-10-31 21:59:30,936 INFO L140 encePairwiseOnDemand]: 344/365 looper letters, 31 selfloop transitions, 28 changer transitions 0/339 dead transitions. [2024-10-31 21:59:30,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 339 transitions, 852 flow [2024-10-31 21:59:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 21:59:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-31 21:59:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3280 transitions. [2024-10-31 21:59:30,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8986301369863013 [2024-10-31 21:59:30,945 INFO L175 Difference]: Start difference. First operand has 307 places, 310 transitions, 668 flow. Second operand 10 states and 3280 transitions. [2024-10-31 21:59:30,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 339 transitions, 852 flow [2024-10-31 21:59:30,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 339 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:30,954 INFO L231 Difference]: Finished difference. Result has 320 places, 326 transitions, 797 flow [2024-10-31 21:59:30,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=797, PETRI_PLACES=320, PETRI_TRANSITIONS=326} [2024-10-31 21:59:30,956 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -15 predicate places. [2024-10-31 21:59:30,956 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 326 transitions, 797 flow [2024-10-31 21:59:30,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 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 21:59:30,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:30,959 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] [2024-10-31 21:59:30,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:59:30,959 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:30,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash 981410635, now seen corresponding path program 1 times [2024-10-31 21:59:30,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:30,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674835693] [2024-10-31 21:59:30,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:30,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:31,147 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 21:59:31,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674835693] [2024-10-31 21:59:31,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674835693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:31,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:31,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:31,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336873552] [2024-10-31 21:59:31,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:31,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:31,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:31,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 365 [2024-10-31 21:59:31,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 326 transitions, 797 flow. Second operand has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 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 21:59:31,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:31,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 365 [2024-10-31 21:59:31,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:31,774 INFO L124 PetriNetUnfolderBase]: 188/2163 cut-off events. [2024-10-31 21:59:31,774 INFO L125 PetriNetUnfolderBase]: For 73/117 co-relation queries the response was YES. [2024-10-31 21:59:31,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 2163 events. 188/2163 cut-off events. For 73/117 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 15531 event pairs, 39 based on Foata normal form. 11/2023 useless extension candidates. Maximal degree in co-relation 2690. Up to 126 conditions per place. [2024-10-31 21:59:31,804 INFO L140 encePairwiseOnDemand]: 359/365 looper letters, 24 selfloop transitions, 5 changer transitions 0/337 dead transitions. [2024-10-31 21:59:31,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 337 transitions, 885 flow [2024-10-31 21:59:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 21:59:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1695 transitions. [2024-10-31 21:59:31,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9287671232876712 [2024-10-31 21:59:31,809 INFO L175 Difference]: Start difference. First operand has 320 places, 326 transitions, 797 flow. Second operand 5 states and 1695 transitions. [2024-10-31 21:59:31,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 337 transitions, 885 flow [2024-10-31 21:59:31,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 337 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:31,816 INFO L231 Difference]: Finished difference. Result has 326 places, 328 transitions, 822 flow [2024-10-31 21:59:31,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=822, PETRI_PLACES=326, PETRI_TRANSITIONS=328} [2024-10-31 21:59:31,818 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -9 predicate places. [2024-10-31 21:59:31,818 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 328 transitions, 822 flow [2024-10-31 21:59:31,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 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 21:59:31,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:31,820 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] [2024-10-31 21:59:31,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:59:31,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:31,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash 444416233, now seen corresponding path program 1 times [2024-10-31 21:59:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:31,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26928420] [2024-10-31 21:59:31,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:31,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:32,435 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 21:59:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26928420] [2024-10-31 21:59:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26928420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:32,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616020101] [2024-10-31 21:59:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:32,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:32,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:32,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:32,996 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 365 [2024-10-31 21:59:32,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 328 transitions, 822 flow. Second operand has 6 states, 6 states have (on average 316.6666666666667) internal successors, (1900), 6 states have internal predecessors, (1900), 0 states have call successors, (0), 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 21:59:32,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:32,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 365 [2024-10-31 21:59:32,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:34,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([898] L64-->L64-1: Formula: (= |v_#race~B~0_7| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_7|} AuxVars[] AssignedVars[#race~B~0][224], [Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork2_~i~1 0)), 139#L64-1true, Black: 415#(<= (+ ~M~0 1) 0), Black: 383#true, 247#L84-4true, Black: 387#true, 385#(= |#race~B~0| 0), 419#true, 382#(= |#race~M~0| 0), 49#L48-1true, 391#true, 389#(= |#race~A~0| 0), Black: 396#(<= ~N~0 0), 412#true, 242#L56-1true, Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(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: 401#(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|)), 367#(= |#race~N~0| 0)]) [2024-10-31 21:59:34,896 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2024-10-31 21:59:34,896 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:34,896 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:34,896 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:35,281 INFO L124 PetriNetUnfolderBase]: 2314/10297 cut-off events. [2024-10-31 21:59:35,286 INFO L125 PetriNetUnfolderBase]: For 869/902 co-relation queries the response was YES. [2024-10-31 21:59:35,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15276 conditions, 10297 events. 2314/10297 cut-off events. For 869/902 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 110596 event pairs, 1091 based on Foata normal form. 0/9454 useless extension candidates. Maximal degree in co-relation 15227. Up to 2999 conditions per place. [2024-10-31 21:59:35,418 INFO L140 encePairwiseOnDemand]: 350/365 looper letters, 46 selfloop transitions, 38 changer transitions 0/373 dead transitions. [2024-10-31 21:59:35,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 373 transitions, 1088 flow [2024-10-31 21:59:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:59:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1973 transitions. [2024-10-31 21:59:35,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009132420091325 [2024-10-31 21:59:35,426 INFO L175 Difference]: Start difference. First operand has 326 places, 328 transitions, 822 flow. Second operand 6 states and 1973 transitions. [2024-10-31 21:59:35,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 373 transitions, 1088 flow [2024-10-31 21:59:35,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 373 transitions, 1083 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:35,448 INFO L231 Difference]: Finished difference. Result has 334 places, 365 transitions, 1071 flow [2024-10-31 21:59:35,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1071, PETRI_PLACES=334, PETRI_TRANSITIONS=365} [2024-10-31 21:59:35,451 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, -1 predicate places. [2024-10-31 21:59:35,452 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 365 transitions, 1071 flow [2024-10-31 21:59:35,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.6666666666667) internal successors, (1900), 6 states have internal predecessors, (1900), 0 states have call successors, (0), 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 21:59:35,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:35,454 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] [2024-10-31 21:59:35,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:59:35,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:35,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:35,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1651683778, now seen corresponding path program 1 times [2024-10-31 21:59:35,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:35,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884797922] [2024-10-31 21:59:35,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:35,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:36,158 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 21:59:36,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:36,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884797922] [2024-10-31 21:59:36,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884797922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:36,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:36,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:36,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819079768] [2024-10-31 21:59:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:36,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:36,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:36,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:36,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:36,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 365 [2024-10-31 21:59:36,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 365 transitions, 1071 flow. Second operand has 6 states, 6 states have (on average 316.8333333333333) internal successors, (1901), 6 states have internal predecessors, (1901), 0 states have call successors, (0), 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 21:59:36,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:36,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 365 [2024-10-31 21:59:36,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:40,686 INFO L124 PetriNetUnfolderBase]: 3904/14408 cut-off events. [2024-10-31 21:59:40,687 INFO L125 PetriNetUnfolderBase]: For 4398/4991 co-relation queries the response was YES. [2024-10-31 21:59:40,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26215 conditions, 14408 events. 3904/14408 cut-off events. For 4398/4991 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 159616 event pairs, 1169 based on Foata normal form. 81/13517 useless extension candidates. Maximal degree in co-relation 26162. Up to 4519 conditions per place. [2024-10-31 21:59:41,044 INFO L140 encePairwiseOnDemand]: 350/365 looper letters, 77 selfloop transitions, 110 changer transitions 0/482 dead transitions. [2024-10-31 21:59:41,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 482 transitions, 2017 flow [2024-10-31 21:59:41,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:59:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1973 transitions. [2024-10-31 21:59:41,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009132420091325 [2024-10-31 21:59:41,050 INFO L175 Difference]: Start difference. First operand has 334 places, 365 transitions, 1071 flow. Second operand 6 states and 1973 transitions. [2024-10-31 21:59:41,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 482 transitions, 2017 flow [2024-10-31 21:59:41,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 482 transitions, 2017 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:41,109 INFO L231 Difference]: Finished difference. Result has 344 places, 474 transitions, 2129 flow [2024-10-31 21:59:41,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2129, PETRI_PLACES=344, PETRI_TRANSITIONS=474} [2024-10-31 21:59:41,111 INFO L277 CegarLoopForPetriNet]: 335 programPoint places, 9 predicate places. [2024-10-31 21:59:41,111 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 474 transitions, 2129 flow [2024-10-31 21:59:41,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.8333333333333) internal successors, (1901), 6 states have internal predecessors, (1901), 0 states have call successors, (0), 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 21:59:41,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:41,114 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 21:59:41,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:59:41,114 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-10-31 21:59:41,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash -890507008, now seen corresponding path program 1 times [2024-10-31 21:59:41,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:41,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045104824] [2024-10-31 21:59:41,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:41,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:41,750 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 21:59:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045104824] [2024-10-31 21:59:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045104824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:41,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511501623] [2024-10-31 21:59:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:41,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:41,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:41,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:41,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:42,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 365 [2024-10-31 21:59:42,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 474 transitions, 2129 flow. Second operand has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 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 21:59:42,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:42,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 365 [2024-10-31 21:59:42,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand