./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:26:47,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:26:47,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:26:47,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:26:47,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:26:47,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:26:47,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:26:47,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:26:47,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:26:47,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:26:47,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:26:47,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:26:47,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:26:47,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:47,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:47,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:26:47,345 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df [2025-01-09 21:26:47,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:26:47,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:26:47,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:26:47,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:26:47,560 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:26:47,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-01-09 21:26:48,697 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c24d9eae/90815c000ee5482486384cf24ae77ded/FLAGb037ee79d [2025-01-09 21:26:48,942 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:26:48,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-01-09 21:26:48,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c24d9eae/90815c000ee5482486384cf24ae77ded/FLAGb037ee79d [2025-01-09 21:26:48,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c24d9eae/90815c000ee5482486384cf24ae77ded [2025-01-09 21:26:48,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:26:48,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:26:48,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:48,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:26:48,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:26:48,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:48" (1/1) ... [2025-01-09 21:26:48,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fd4485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:48, skipping insertion in model container [2025-01-09 21:26:48,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:48" (1/1) ... [2025-01-09 21:26:49,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:26:49,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:49,285 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:26:49,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:49,356 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:26:49,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49 WrapperNode [2025-01-09 21:26:49,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:49,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:49,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:26:49,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:26:49,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,383 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2025-01-09 21:26:49,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:49,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:26:49,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:26:49,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:26:49,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:26:49,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:26:49,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:26:49,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:26:49,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (1/1) ... [2025-01-09 21:26:49,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:49,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:26:49,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:26:49,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:26:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:26:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:26:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:26:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:26:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:26:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:26:49,463 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:26:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:26:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:26:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:26:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:26:49,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:26:49,464 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:26:49,544 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:26:49,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:26:49,751 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:26:49,751 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:26:49,780 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:26:49,780 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:26:49,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:49 BoogieIcfgContainer [2025-01-09 21:26:49,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:26:49,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:26:49,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:26:49,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:26:49,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:26:48" (1/3) ... [2025-01-09 21:26:49,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72aaa02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:49, skipping insertion in model container [2025-01-09 21:26:49,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:49" (2/3) ... [2025-01-09 21:26:49,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72aaa02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:49, skipping insertion in model container [2025-01-09 21:26:49,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:49" (3/3) ... [2025-01-09 21:26:49,788 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2025-01-09 21:26:49,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:26:49,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_11-ptr_racing.i that has 2 procedures, 158 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-01-09 21:26:49,809 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:26:49,873 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:26:49,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 169 transitions, 345 flow [2025-01-09 21:26:49,952 INFO L124 PetriNetUnfolderBase]: 15/231 cut-off events. [2025-01-09 21:26:49,954 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:26:49,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 231 events. 15/231 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 722 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 129. Up to 4 conditions per place. [2025-01-09 21:26:49,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 169 transitions, 345 flow [2025-01-09 21:26:49,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 169 transitions, 345 flow [2025-01-09 21:26:49,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:49,975 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;@527ac2b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:49,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-09 21:26:50,008 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:50,017 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2025-01-09 21:26:50,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:50,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:50,018 INFO L206 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] [2025-01-09 21:26:50,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:50,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:50,030 INFO L85 PathProgramCache]: Analyzing trace with hash -496039989, now seen corresponding path program 1 times [2025-01-09 21:26:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134580648] [2025-01-09 21:26:50,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:50,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:50,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:26:50,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:26:50,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:50,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:50,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:50,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134580648] [2025-01-09 21:26:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134580648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:50,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:50,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283640281] [2025-01-09 21:26:50,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:50,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:50,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:50,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:50,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:51,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 169 [2025-01-09 21:26:51,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 169 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:51,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:51,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 169 [2025-01-09 21:26:51,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:51,423 INFO L124 PetriNetUnfolderBase]: 579/2155 cut-off events. [2025-01-09 21:26:51,424 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:26:51,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3413 conditions, 2155 events. 579/2155 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 15037 event pairs, 357 based on Foata normal form. 178/2184 useless extension candidates. Maximal degree in co-relation 3264. Up to 1080 conditions per place. [2025-01-09 21:26:51,436 INFO L140 encePairwiseOnDemand]: 136/169 looper letters, 73 selfloop transitions, 70 changer transitions 0/250 dead transitions. [2025-01-09 21:26:51,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 250 transitions, 793 flow [2025-01-09 21:26:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 826 transitions. [2025-01-09 21:26:51,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.814595660749507 [2025-01-09 21:26:51,448 INFO L175 Difference]: Start difference. First operand has 161 places, 169 transitions, 345 flow. Second operand 6 states and 826 transitions. [2025-01-09 21:26:51,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 250 transitions, 793 flow [2025-01-09 21:26:51,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 250 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:51,457 INFO L231 Difference]: Finished difference. Result has 169 places, 226 transitions, 783 flow [2025-01-09 21:26:51,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=169, PETRI_TRANSITIONS=226} [2025-01-09 21:26:51,461 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 8 predicate places. [2025-01-09 21:26:51,461 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 226 transitions, 783 flow [2025-01-09 21:26:51,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:51,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:51,461 INFO L206 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] [2025-01-09 21:26:51,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:26:51,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:51,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1596566831, now seen corresponding path program 1 times [2025-01-09 21:26:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:51,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855126624] [2025-01-09 21:26:51,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:51,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:26:51,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:26:51,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:51,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:51,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:51,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855126624] [2025-01-09 21:26:51,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855126624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:51,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:51,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:51,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052364276] [2025-01-09 21:26:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:51,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:51,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:51,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:51,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 169 [2025-01-09 21:26:51,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 226 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:51,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:51,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 169 [2025-01-09 21:26:51,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:51,629 INFO L124 PetriNetUnfolderBase]: 188/1078 cut-off events. [2025-01-09 21:26:51,630 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-01-09 21:26:51,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1780 conditions, 1078 events. 188/1078 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6278 event pairs, 28 based on Foata normal form. 1/1007 useless extension candidates. Maximal degree in co-relation 1671. Up to 191 conditions per place. [2025-01-09 21:26:51,634 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 22 selfloop transitions, 3 changer transitions 0/232 dead transitions. [2025-01-09 21:26:51,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 232 transitions, 845 flow [2025-01-09 21:26:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2025-01-09 21:26:51,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8777120315581854 [2025-01-09 21:26:51,635 INFO L175 Difference]: Start difference. First operand has 169 places, 226 transitions, 783 flow. Second operand 3 states and 445 transitions. [2025-01-09 21:26:51,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 232 transitions, 845 flow [2025-01-09 21:26:51,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 232 transitions, 845 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:51,641 INFO L231 Difference]: Finished difference. Result has 172 places, 226 transitions, 794 flow [2025-01-09 21:26:51,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=172, PETRI_TRANSITIONS=226} [2025-01-09 21:26:51,641 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 11 predicate places. [2025-01-09 21:26:51,641 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 226 transitions, 794 flow [2025-01-09 21:26:51,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:51,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:51,642 INFO L206 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] [2025-01-09 21:26:51,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:26:51,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:51,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1383489785, now seen corresponding path program 1 times [2025-01-09 21:26:51,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:51,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886602747] [2025-01-09 21:26:51,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:51,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:51,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:26:51,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:26:51,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:51,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:51,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:51,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886602747] [2025-01-09 21:26:51,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886602747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:51,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:51,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:51,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063487250] [2025-01-09 21:26:51,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:51,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:51,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:51,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:51,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:52,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 169 [2025-01-09 21:26:52,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 226 transitions, 794 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:52,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:52,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 169 [2025-01-09 21:26:52,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:52,313 INFO L124 PetriNetUnfolderBase]: 370/1581 cut-off events. [2025-01-09 21:26:52,313 INFO L125 PetriNetUnfolderBase]: For 466/478 co-relation queries the response was YES. [2025-01-09 21:26:52,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3266 conditions, 1581 events. 370/1581 cut-off events. For 466/478 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10788 event pairs, 96 based on Foata normal form. 2/1526 useless extension candidates. Maximal degree in co-relation 3145. Up to 642 conditions per place. [2025-01-09 21:26:52,321 INFO L140 encePairwiseOnDemand]: 151/169 looper letters, 112 selfloop transitions, 53 changer transitions 0/285 dead transitions. [2025-01-09 21:26:52,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 285 transitions, 1366 flow [2025-01-09 21:26:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 797 transitions. [2025-01-09 21:26:52,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7859960552268245 [2025-01-09 21:26:52,323 INFO L175 Difference]: Start difference. First operand has 172 places, 226 transitions, 794 flow. Second operand 6 states and 797 transitions. [2025-01-09 21:26:52,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 285 transitions, 1366 flow [2025-01-09 21:26:52,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 285 transitions, 1360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:52,330 INFO L231 Difference]: Finished difference. Result has 180 places, 269 transitions, 1276 flow [2025-01-09 21:26:52,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1276, PETRI_PLACES=180, PETRI_TRANSITIONS=269} [2025-01-09 21:26:52,331 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 19 predicate places. [2025-01-09 21:26:52,331 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 269 transitions, 1276 flow [2025-01-09 21:26:52,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:52,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:52,332 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:52,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:26:52,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:52,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1106479565, now seen corresponding path program 1 times [2025-01-09 21:26:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:52,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485307148] [2025-01-09 21:26:52,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:52,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:26:52,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:26:52,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:52,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:52,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:26:52,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:26:52,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:26:52,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:52,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:52,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:26:52,403 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:26:52,403 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-01-09 21:26:52,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-01-09 21:26:52,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-01-09 21:26:52,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-01-09 21:26:52,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-01-09 21:26:52,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-01-09 21:26:52,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-01-09 21:26:52,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-01-09 21:26:52,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-01-09 21:26:52,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-01-09 21:26:52,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-01-09 21:26:52,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-01-09 21:26:52,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:26:52,405 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:26:52,409 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:26:52,409 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:26:52,447 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:26:52,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 235 transitions, 486 flow [2025-01-09 21:26:52,480 INFO L124 PetriNetUnfolderBase]: 27/386 cut-off events. [2025-01-09 21:26:52,481 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:26:52,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 386 events. 27/386 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1465 event pairs, 0 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 233. Up to 6 conditions per place. [2025-01-09 21:26:52,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 235 transitions, 486 flow [2025-01-09 21:26:52,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 235 transitions, 486 flow [2025-01-09 21:26:52,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:52,486 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;@527ac2b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:52,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:26:52,490 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:52,490 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2025-01-09 21:26:52,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:52,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:52,491 INFO L206 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] [2025-01-09 21:26:52,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:52,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash 498050571, now seen corresponding path program 1 times [2025-01-09 21:26:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:52,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214223870] [2025-01-09 21:26:52,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:52,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:52,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:26:52,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:26:52,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:52,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:52,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214223870] [2025-01-09 21:26:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214223870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:52,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:52,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238562634] [2025-01-09 21:26:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:52,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:52,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:52,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 235 [2025-01-09 21:26:52,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 235 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:52,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:52,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 235 [2025-01-09 21:26:52,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:58,581 INFO L124 PetriNetUnfolderBase]: 29152/68567 cut-off events. [2025-01-09 21:26:58,581 INFO L125 PetriNetUnfolderBase]: For 713/713 co-relation queries the response was YES. [2025-01-09 21:26:58,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114105 conditions, 68567 events. 29152/68567 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 1182. Compared 763861 event pairs, 20498 based on Foata normal form. 6991/71472 useless extension candidates. Maximal degree in co-relation 89901. Up to 40551 conditions per place. [2025-01-09 21:26:58,861 INFO L140 encePairwiseOnDemand]: 180/235 looper letters, 122 selfloop transitions, 134 changer transitions 0/399 dead transitions. [2025-01-09 21:26:58,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 399 transitions, 1331 flow [2025-01-09 21:26:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1185 transitions. [2025-01-09 21:26:58,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8404255319148937 [2025-01-09 21:26:58,868 INFO L175 Difference]: Start difference. First operand has 222 places, 235 transitions, 486 flow. Second operand 6 states and 1185 transitions. [2025-01-09 21:26:58,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 399 transitions, 1331 flow [2025-01-09 21:26:58,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 399 transitions, 1331 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:58,880 INFO L231 Difference]: Finished difference. Result has 230 places, 350 transitions, 1328 flow [2025-01-09 21:26:58,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1328, PETRI_PLACES=230, PETRI_TRANSITIONS=350} [2025-01-09 21:26:58,880 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 8 predicate places. [2025-01-09 21:26:58,881 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 350 transitions, 1328 flow [2025-01-09 21:26:58,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:58,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:58,881 INFO L206 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] [2025-01-09 21:26:58,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:26:58,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:26:58,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:58,882 INFO L85 PathProgramCache]: Analyzing trace with hash 241729137, now seen corresponding path program 1 times [2025-01-09 21:26:58,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:58,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757337705] [2025-01-09 21:26:58,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:58,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:58,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:26:58,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:26:58,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:58,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:58,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:58,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757337705] [2025-01-09 21:26:58,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757337705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:58,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:58,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:58,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85827516] [2025-01-09 21:26:58,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:58,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:58,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:58,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:58,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:58,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 235 [2025-01-09 21:26:58,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 350 transitions, 1328 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:26:58,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:58,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 235 [2025-01-09 21:26:58,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:01,661 INFO L124 PetriNetUnfolderBase]: 9805/30884 cut-off events. [2025-01-09 21:27:01,662 INFO L125 PetriNetUnfolderBase]: For 5113/5430 co-relation queries the response was YES. [2025-01-09 21:27:01,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55299 conditions, 30884 events. 9805/30884 cut-off events. For 5113/5430 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 349841 event pairs, 3954 based on Foata normal form. 1/28359 useless extension candidates. Maximal degree in co-relation 51255. Up to 9251 conditions per place. [2025-01-09 21:27:01,842 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 32 selfloop transitions, 3 changer transitions 0/358 dead transitions. [2025-01-09 21:27:01,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 358 transitions, 1420 flow [2025-01-09 21:27:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2025-01-09 21:27:01,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652482269503546 [2025-01-09 21:27:01,844 INFO L175 Difference]: Start difference. First operand has 230 places, 350 transitions, 1328 flow. Second operand 3 states and 610 transitions. [2025-01-09 21:27:01,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 358 transitions, 1420 flow [2025-01-09 21:27:01,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 358 transitions, 1420 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:01,925 INFO L231 Difference]: Finished difference. Result has 233 places, 352 transitions, 1353 flow [2025-01-09 21:27:01,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1353, PETRI_PLACES=233, PETRI_TRANSITIONS=352} [2025-01-09 21:27:01,927 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 11 predicate places. [2025-01-09 21:27:01,928 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 352 transitions, 1353 flow [2025-01-09 21:27:01,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:01,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:01,928 INFO L206 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] [2025-01-09 21:27:01,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:27:01,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:27:01,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash 572755097, now seen corresponding path program 1 times [2025-01-09 21:27:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:01,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671499279] [2025-01-09 21:27:01,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:01,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:27:01,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:27:01,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:01,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:02,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:02,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671499279] [2025-01-09 21:27:02,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671499279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:02,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:02,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490095563] [2025-01-09 21:27:02,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:02,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:02,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:02,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:02,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 235 [2025-01-09 21:27:02,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 352 transitions, 1353 flow. Second operand has 6 states, 6 states have (on average 165.16666666666666) internal successors, (991), 6 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:02,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:02,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 235 [2025-01-09 21:27:02,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:07,277 INFO L124 PetriNetUnfolderBase]: 21476/52262 cut-off events. [2025-01-09 21:27:07,277 INFO L125 PetriNetUnfolderBase]: For 18731/19818 co-relation queries the response was YES. [2025-01-09 21:27:07,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117113 conditions, 52262 events. 21476/52262 cut-off events. For 18731/19818 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 577133 event pairs, 8048 based on Foata normal form. 47/49699 useless extension candidates. Maximal degree in co-relation 116941. Up to 25420 conditions per place. [2025-01-09 21:27:07,572 INFO L140 encePairwiseOnDemand]: 209/235 looper letters, 192 selfloop transitions, 141 changer transitions 0/531 dead transitions. [2025-01-09 21:27:07,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 531 transitions, 2821 flow [2025-01-09 21:27:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1141 transitions. [2025-01-09 21:27:07,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8092198581560284 [2025-01-09 21:27:07,575 INFO L175 Difference]: Start difference. First operand has 233 places, 352 transitions, 1353 flow. Second operand 6 states and 1141 transitions. [2025-01-09 21:27:07,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 531 transitions, 2821 flow [2025-01-09 21:27:07,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 531 transitions, 2818 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:27:07,716 INFO L231 Difference]: Finished difference. Result has 242 places, 483 transitions, 2734 flow [2025-01-09 21:27:07,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2734, PETRI_PLACES=242, PETRI_TRANSITIONS=483} [2025-01-09 21:27:07,717 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 20 predicate places. [2025-01-09 21:27:07,717 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 483 transitions, 2734 flow [2025-01-09 21:27:07,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.16666666666666) internal successors, (991), 6 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:07,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:07,721 INFO L206 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] [2025-01-09 21:27:07,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:27:07,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:27:07,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash 983368575, now seen corresponding path program 1 times [2025-01-09 21:27:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:07,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107803535] [2025-01-09 21:27:07,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:07,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:27:07,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:27:07,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:07,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:07,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:07,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107803535] [2025-01-09 21:27:07,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107803535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:07,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:07,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:07,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732378871] [2025-01-09 21:27:07,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:07,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:27:07,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:07,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:27:07,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:27:07,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 235 [2025-01-09 21:27:07,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 483 transitions, 2734 flow. Second operand has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:07,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:07,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 235 [2025-01-09 21:27:07,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:11,830 INFO L124 PetriNetUnfolderBase]: 13505/41753 cut-off events. [2025-01-09 21:27:11,830 INFO L125 PetriNetUnfolderBase]: For 20762/22249 co-relation queries the response was YES. [2025-01-09 21:27:11,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90624 conditions, 41753 events. 13505/41753 cut-off events. For 20762/22249 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 490063 event pairs, 3263 based on Foata normal form. 51/38605 useless extension candidates. Maximal degree in co-relation 35242. Up to 12797 conditions per place. [2025-01-09 21:27:12,070 INFO L140 encePairwiseOnDemand]: 230/235 looper letters, 56 selfloop transitions, 7 changer transitions 0/515 dead transitions. [2025-01-09 21:27:12,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 515 transitions, 2924 flow [2025-01-09 21:27:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1202 transitions. [2025-01-09 21:27:12,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8524822695035461 [2025-01-09 21:27:12,073 INFO L175 Difference]: Start difference. First operand has 242 places, 483 transitions, 2734 flow. Second operand 6 states and 1202 transitions. [2025-01-09 21:27:12,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 515 transitions, 2924 flow [2025-01-09 21:27:12,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 515 transitions, 2906 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:12,194 INFO L231 Difference]: Finished difference. Result has 250 places, 485 transitions, 2748 flow [2025-01-09 21:27:12,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2716, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2748, PETRI_PLACES=250, PETRI_TRANSITIONS=485} [2025-01-09 21:27:12,195 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 28 predicate places. [2025-01-09 21:27:12,195 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 485 transitions, 2748 flow [2025-01-09 21:27:12,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:12,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:12,196 INFO L206 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] [2025-01-09 21:27:12,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:27:12,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:27:12,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1734434466, now seen corresponding path program 1 times [2025-01-09 21:27:12,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:12,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995425872] [2025-01-09 21:27:12,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:12,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:27:12,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:27:12,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:12,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995425872] [2025-01-09 21:27:12,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995425872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:12,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:12,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798215591] [2025-01-09 21:27:12,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:12,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:12,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:12,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:12,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:12,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 235 [2025-01-09 21:27:12,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 485 transitions, 2748 flow. Second operand has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:12,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:12,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 235 [2025-01-09 21:27:12,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:23,213 INFO L124 PetriNetUnfolderBase]: 44845/102377 cut-off events. [2025-01-09 21:27:23,214 INFO L125 PetriNetUnfolderBase]: For 67970/71444 co-relation queries the response was YES. [2025-01-09 21:27:23,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259790 conditions, 102377 events. 44845/102377 cut-off events. For 67970/71444 co-relation queries the response was YES. Maximal size of possible extension queue 1650. Compared 1175541 event pairs, 22595 based on Foata normal form. 120/96876 useless extension candidates. Maximal degree in co-relation 231083. Up to 64117 conditions per place. [2025-01-09 21:27:23,994 INFO L140 encePairwiseOnDemand]: 200/235 looper letters, 372 selfloop transitions, 245 changer transitions 0/768 dead transitions. [2025-01-09 21:27:23,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 768 transitions, 5440 flow [2025-01-09 21:27:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1114 transitions. [2025-01-09 21:27:23,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900709219858156 [2025-01-09 21:27:23,997 INFO L175 Difference]: Start difference. First operand has 250 places, 485 transitions, 2748 flow. Second operand 6 states and 1114 transitions. [2025-01-09 21:27:23,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 768 transitions, 5440 flow [2025-01-09 21:27:24,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 768 transitions, 5430 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:24,387 INFO L231 Difference]: Finished difference. Result has 258 places, 720 transitions, 5256 flow [2025-01-09 21:27:24,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2738, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5256, PETRI_PLACES=258, PETRI_TRANSITIONS=720} [2025-01-09 21:27:24,388 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 36 predicate places. [2025-01-09 21:27:24,388 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 720 transitions, 5256 flow [2025-01-09 21:27:24,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:24,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:24,389 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:24,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:27:24,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:27:24,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1377289115, now seen corresponding path program 1 times [2025-01-09 21:27:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:24,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508945376] [2025-01-09 21:27:24,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:24,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:27:24,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:27:24,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:24,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:24,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:24,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508945376] [2025-01-09 21:27:24,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508945376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:24,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:27:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384588570] [2025-01-09 21:27:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:24,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:27:24,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:24,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:27:24,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:27:25,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 235 [2025-01-09 21:27:25,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 720 transitions, 5256 flow. Second operand has 11 states, 11 states have (on average 142.0) internal successors, (1562), 11 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:25,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:25,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 235 [2025-01-09 21:27:25,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand