./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing-2.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_61-invariant_racing-2.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 3465c34fa1c26a5c7a3494350123ab41e5828c33cb08ac3f67b81737d460e559 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:27:56,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:27:57,000 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:27:57,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:27:57,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:27:57,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:27:57,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:27:57,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:27:57,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:27:57,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:27:57,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:27:57,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:27:57,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:57,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:57,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:27:57,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:27:57,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:27:57,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:27:57,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:27:57,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:27:57,035 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 -> 3465c34fa1c26a5c7a3494350123ab41e5828c33cb08ac3f67b81737d460e559 [2025-01-09 21:27:57,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:27:57,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:27:57,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:27:57,243 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:27:57,244 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:27:57,244 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_61-invariant_racing-2.i [2025-01-09 21:27:58,394 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a55fbf3b9/a947bfbfaf464cffb603661407352c20/FLAG20b922632 [2025-01-09 21:27:58,748 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:27:58,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing-2.i [2025-01-09 21:27:58,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a55fbf3b9/a947bfbfaf464cffb603661407352c20/FLAG20b922632 [2025-01-09 21:27:58,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a55fbf3b9/a947bfbfaf464cffb603661407352c20 [2025-01-09 21:27:58,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:27:58,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:27:58,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:58,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:27:58,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:27:58,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:58" (1/1) ... [2025-01-09 21:27:58,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:58, skipping insertion in model container [2025-01-09 21:27:58,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:58" (1/1) ... [2025-01-09 21:27:59,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:27:59,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:59,186 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:27:59,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:59,253 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:27:59,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59 WrapperNode [2025-01-09 21:27:59,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:59,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:59,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:27:59,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:27:59,260 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:27:59" (1/1) ... [2025-01-09 21:27:59,268 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:27:59" (1/1) ... [2025-01-09 21:27:59,280 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2025-01-09 21:27:59,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:59,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:27:59,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:27:59,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:27:59,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,292 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:27:59,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:27:59,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:27:59,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:27:59,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (1/1) ... [2025-01-09 21:27:59,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:59,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:27:59,326 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:27:59,334 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:27:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:27:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:27:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:27:59,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:27:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:27:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:27:59,348 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:27:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:27:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:27:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:27:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:27:59,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:27:59,349 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:27:59,451 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:27:59,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:27:59,664 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:27:59,664 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:27:59,695 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:27:59,695 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-09 21:27:59,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:59 BoogieIcfgContainer [2025-01-09 21:27:59,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:27:59,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:27:59,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:27:59,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:27:59,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:27:58" (1/3) ... [2025-01-09 21:27:59,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345fe2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:59, skipping insertion in model container [2025-01-09 21:27:59,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:59" (2/3) ... [2025-01-09 21:27:59,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345fe2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:59, skipping insertion in model container [2025-01-09 21:27:59,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:59" (3/3) ... [2025-01-09 21:27:59,702 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing-2.i [2025-01-09 21:27:59,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:27:59,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_61-invariant_racing-2.i that has 2 procedures, 167 locations, 1 initial locations, 9 loop locations, and 12 error locations. [2025-01-09 21:27:59,714 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:27:59,754 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:27:59,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 185 transitions, 377 flow [2025-01-09 21:27:59,835 INFO L124 PetriNetUnfolderBase]: 28/282 cut-off events. [2025-01-09 21:27:59,837 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:27:59,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 282 events. 28/282 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1117 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 154. Up to 6 conditions per place. [2025-01-09 21:27:59,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 185 transitions, 377 flow [2025-01-09 21:27:59,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 185 transitions, 377 flow [2025-01-09 21:27:59,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:59,859 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;@67ce0acf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:59,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-09 21:27:59,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:59,868 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-09 21:27:59,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:59,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:59,869 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] [2025-01-09 21:27:59,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:27:59,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash -833030138, now seen corresponding path program 1 times [2025-01-09 21:27:59,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:59,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833040514] [2025-01-09 21:27:59,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:59,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:59,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:27:59,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:27:59,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:59,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:00,071 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:28:00,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:00,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833040514] [2025-01-09 21:28:00,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833040514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:00,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:00,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024703791] [2025-01-09 21:28:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:00,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:00,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:00,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:00,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:00,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 185 [2025-01-09 21:28:00,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 185 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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:28:00,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:00,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 185 [2025-01-09 21:28:00,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:00,288 INFO L124 PetriNetUnfolderBase]: 85/894 cut-off events. [2025-01-09 21:28:00,288 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:28:00,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 894 events. 85/894 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5262 event pairs, 0 based on Foata normal form. 109/914 useless extension candidates. Maximal degree in co-relation 1016. Up to 184 conditions per place. [2025-01-09 21:28:00,294 INFO L140 encePairwiseOnDemand]: 166/185 looper letters, 28 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2025-01-09 21:28:00,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 174 transitions, 415 flow [2025-01-09 21:28:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-01-09 21:28:00,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8792792792792793 [2025-01-09 21:28:00,305 INFO L175 Difference]: Start difference. First operand has 170 places, 185 transitions, 377 flow. Second operand 3 states and 488 transitions. [2025-01-09 21:28:00,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 174 transitions, 415 flow [2025-01-09 21:28:00,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 174 transitions, 415 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:00,313 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 349 flow [2025-01-09 21:28:00,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=171, PETRI_TRANSITIONS=167} [2025-01-09 21:28:00,317 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 1 predicate places. [2025-01-09 21:28:00,317 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 349 flow [2025-01-09 21:28:00,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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:28:00,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:00,317 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] [2025-01-09 21:28:00,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:28:00,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:00,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:00,318 INFO L85 PathProgramCache]: Analyzing trace with hash -200642610, now seen corresponding path program 1 times [2025-01-09 21:28:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:00,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534511035] [2025-01-09 21:28:00,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:00,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:28:00,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:28:00,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:00,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:00,767 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:28:00,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:00,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534511035] [2025-01-09 21:28:00,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534511035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:00,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:00,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:00,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645408295] [2025-01-09 21:28:00,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:00,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:00,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:00,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:00,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:00,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 185 [2025-01-09 21:28:00,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 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:28:00,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:00,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 185 [2025-01-09 21:28:00,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:01,069 INFO L124 PetriNetUnfolderBase]: 157/1056 cut-off events. [2025-01-09 21:28:01,069 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-09 21:28:01,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 1056 events. 157/1056 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6761 event pairs, 102 based on Foata normal form. 0/960 useless extension candidates. Maximal degree in co-relation 1352. Up to 267 conditions per place. [2025-01-09 21:28:01,083 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 57 selfloop transitions, 5 changer transitions 0/194 dead transitions. [2025-01-09 21:28:01,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 194 transitions, 527 flow [2025-01-09 21:28:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 861 transitions. [2025-01-09 21:28:01,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7756756756756756 [2025-01-09 21:28:01,087 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 349 flow. Second operand 6 states and 861 transitions. [2025-01-09 21:28:01,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 194 transitions, 527 flow [2025-01-09 21:28:01,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 194 transitions, 523 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:01,093 INFO L231 Difference]: Finished difference. Result has 173 places, 166 transitions, 353 flow [2025-01-09 21:28:01,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=173, PETRI_TRANSITIONS=166} [2025-01-09 21:28:01,093 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 3 predicate places. [2025-01-09 21:28:01,093 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 166 transitions, 353 flow [2025-01-09 21:28:01,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 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:28:01,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:01,094 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] [2025-01-09 21:28:01,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:28:01,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:01,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1111054886, now seen corresponding path program 1 times [2025-01-09 21:28:01,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:01,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907139781] [2025-01-09 21:28:01,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:01,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:01,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:28:01,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:28:01,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:01,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:01,168 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:28:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:01,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907139781] [2025-01-09 21:28:01,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907139781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:01,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:01,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:01,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028621125] [2025-01-09 21:28:01,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:01,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:01,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:01,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:01,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2025-01-09 21:28:01,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 166 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:28:01,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:01,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2025-01-09 21:28:01,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:01,431 INFO L124 PetriNetUnfolderBase]: 361/2125 cut-off events. [2025-01-09 21:28:01,431 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:28:01,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 2125 events. 361/2125 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 15826 event pairs, 136 based on Foata normal form. 0/1923 useless extension candidates. Maximal degree in co-relation 2882. Up to 462 conditions per place. [2025-01-09 21:28:01,442 INFO L140 encePairwiseOnDemand]: 163/185 looper letters, 55 selfloop transitions, 16 changer transitions 0/198 dead transitions. [2025-01-09 21:28:01,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 198 transitions, 562 flow [2025-01-09 21:28:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2025-01-09 21:28:01,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.836036036036036 [2025-01-09 21:28:01,444 INFO L175 Difference]: Start difference. First operand has 173 places, 166 transitions, 353 flow. Second operand 3 states and 464 transitions. [2025-01-09 21:28:01,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 198 transitions, 562 flow [2025-01-09 21:28:01,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 198 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:28:01,451 INFO L231 Difference]: Finished difference. Result has 172 places, 182 transitions, 483 flow [2025-01-09 21:28:01,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=172, PETRI_TRANSITIONS=182} [2025-01-09 21:28:01,451 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 2 predicate places. [2025-01-09 21:28:01,452 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 182 transitions, 483 flow [2025-01-09 21:28:01,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:28:01,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:01,452 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] [2025-01-09 21:28:01,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:28:01,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:28:01,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1728284474, now seen corresponding path program 1 times [2025-01-09 21:28:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:01,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048115089] [2025-01-09 21:28:01,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:01,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:01,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:28:01,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:28:01,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:01,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:01,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:28:01,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:28:01,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:28:01,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:01,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:01,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:28:01,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:28:01,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-01-09 21:28:01,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-01-09 21:28:01,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:28:01,540 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:28:01,546 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:28:01,546 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:28:01,575 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:28:01,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 241 transitions, 498 flow [2025-01-09 21:28:01,627 INFO L124 PetriNetUnfolderBase]: 47/462 cut-off events. [2025-01-09 21:28:01,627 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:28:01,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 462 events. 47/462 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2049 event pairs, 0 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 284. Up to 9 conditions per place. [2025-01-09 21:28:01,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 241 transitions, 498 flow [2025-01-09 21:28:01,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 241 transitions, 498 flow [2025-01-09 21:28:01,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:01,635 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;@67ce0acf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:01,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:28:01,639 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:01,639 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-09 21:28:01,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:01,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:01,639 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] [2025-01-09 21:28:01,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1481696762, now seen corresponding path program 1 times [2025-01-09 21:28:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528919026] [2025-01-09 21:28:01,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:01,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:28:01,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:28:01,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:01,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:01,670 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:28:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528919026] [2025-01-09 21:28:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528919026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:01,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:01,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862842470] [2025-01-09 21:28:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:01,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:01,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:01,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:01,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:01,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 241 [2025-01-09 21:28:01,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 241 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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:28:01,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:01,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 241 [2025-01-09 21:28:01,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:02,495 INFO L124 PetriNetUnfolderBase]: 1621/8070 cut-off events. [2025-01-09 21:28:02,496 INFO L125 PetriNetUnfolderBase]: For 87/91 co-relation queries the response was YES. [2025-01-09 21:28:02,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10588 conditions, 8070 events. 1621/8070 cut-off events. For 87/91 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 85242 event pairs, 686 based on Foata normal form. 1345/8482 useless extension candidates. Maximal degree in co-relation 1403. Up to 2462 conditions per place. [2025-01-09 21:28:02,536 INFO L140 encePairwiseOnDemand]: 216/241 looper letters, 38 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-01-09 21:28:02,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 225 transitions, 546 flow [2025-01-09 21:28:02,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2025-01-09 21:28:02,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8672199170124482 [2025-01-09 21:28:02,539 INFO L175 Difference]: Start difference. First operand has 220 places, 241 transitions, 498 flow. Second operand 3 states and 627 transitions. [2025-01-09 21:28:02,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 225 transitions, 546 flow [2025-01-09 21:28:02,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 225 transitions, 546 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:02,546 INFO L231 Difference]: Finished difference. Result has 221 places, 218 transitions, 462 flow [2025-01-09 21:28:02,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=221, PETRI_TRANSITIONS=218} [2025-01-09 21:28:02,547 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 1 predicate places. [2025-01-09 21:28:02,547 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 218 transitions, 462 flow [2025-01-09 21:28:02,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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:28:02,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:02,547 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] [2025-01-09 21:28:02,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:28:02,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:02,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1569934177, now seen corresponding path program 1 times [2025-01-09 21:28:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:02,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180717887] [2025-01-09 21:28:02,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:02,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:28:02,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:28:02,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:02,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:02,817 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:28:02,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:02,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180717887] [2025-01-09 21:28:02,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180717887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:02,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:02,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:02,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120806117] [2025-01-09 21:28:02,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:02,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:02,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:02,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:02,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:02,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 241 [2025-01-09 21:28:02,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 218 transitions, 462 flow. Second operand has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 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:28:02,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:02,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 241 [2025-01-09 21:28:02,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:03,852 INFO L124 PetriNetUnfolderBase]: 2772/10310 cut-off events. [2025-01-09 21:28:03,853 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-01-09 21:28:03,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14938 conditions, 10310 events. 2772/10310 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 109324 event pairs, 1354 based on Foata normal form. 0/9435 useless extension candidates. Maximal degree in co-relation 12922. Up to 3388 conditions per place. [2025-01-09 21:28:03,909 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 94 selfloop transitions, 6 changer transitions 0/273 dead transitions. [2025-01-09 21:28:03,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 273 transitions, 772 flow [2025-01-09 21:28:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1144 transitions. [2025-01-09 21:28:03,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7911479944674965 [2025-01-09 21:28:03,914 INFO L175 Difference]: Start difference. First operand has 221 places, 218 transitions, 462 flow. Second operand 6 states and 1144 transitions. [2025-01-09 21:28:03,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 273 transitions, 772 flow [2025-01-09 21:28:03,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 273 transitions, 770 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:03,919 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 470 flow [2025-01-09 21:28:03,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=470, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2025-01-09 21:28:03,921 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 4 predicate places. [2025-01-09 21:28:03,921 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 470 flow [2025-01-09 21:28:03,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 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:28:03,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:03,922 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] [2025-01-09 21:28:03,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:28:03,922 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:03,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash -143180331, now seen corresponding path program 1 times [2025-01-09 21:28:03,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:03,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973810644] [2025-01-09 21:28:03,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:03,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:03,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:28:03,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:28:03,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:03,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:03,949 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:28:03,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:03,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973810644] [2025-01-09 21:28:03,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973810644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:03,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:03,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:03,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671626688] [2025-01-09 21:28:03,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:03,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:03,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:03,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:03,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:04,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 241 [2025-01-09 21:28:04,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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:28:04,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:04,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 241 [2025-01-09 21:28:04,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:07,986 INFO L124 PetriNetUnfolderBase]: 17343/55534 cut-off events. [2025-01-09 21:28:07,986 INFO L125 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2025-01-09 21:28:08,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83718 conditions, 55534 events. 17343/55534 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 710360 event pairs, 6436 based on Foata normal form. 0/49609 useless extension candidates. Maximal degree in co-relation 69220. Up to 16484 conditions per place. [2025-01-09 21:28:08,447 INFO L140 encePairwiseOnDemand]: 208/241 looper letters, 84 selfloop transitions, 24 changer transitions 0/266 dead transitions. [2025-01-09 21:28:08,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 266 transitions, 795 flow [2025-01-09 21:28:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 594 transitions. [2025-01-09 21:28:08,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8215767634854771 [2025-01-09 21:28:08,449 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 470 flow. Second operand 3 states and 594 transitions. [2025-01-09 21:28:08,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 266 transitions, 795 flow [2025-01-09 21:28:08,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 266 transitions, 783 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:28:08,454 INFO L231 Difference]: Finished difference. Result has 223 places, 241 transitions, 668 flow [2025-01-09 21:28:08,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=223, PETRI_TRANSITIONS=241} [2025-01-09 21:28:08,454 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 3 predicate places. [2025-01-09 21:28:08,455 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 241 transitions, 668 flow [2025-01-09 21:28:08,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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:28:08,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:08,455 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] [2025-01-09 21:28:08,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:28:08,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:08,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1497890870, now seen corresponding path program 1 times [2025-01-09 21:28:08,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:08,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434701745] [2025-01-09 21:28:08,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:08,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:08,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:28:08,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:28:08,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:08,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:08,510 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:28:08,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434701745] [2025-01-09 21:28:08,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434701745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:08,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:08,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:08,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501858025] [2025-01-09 21:28:08,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:08,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:28:08,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:08,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:28:08,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:28:08,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 241 [2025-01-09 21:28:08,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 241 transitions, 668 flow. Second operand has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 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:28:08,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:08,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 241 [2025-01-09 21:28:08,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:11,626 INFO L124 PetriNetUnfolderBase]: 9524/44343 cut-off events. [2025-01-09 21:28:11,626 INFO L125 PetriNetUnfolderBase]: For 3442/3702 co-relation queries the response was YES. [2025-01-09 21:28:11,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67021 conditions, 44343 events. 9524/44343 cut-off events. For 3442/3702 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 615784 event pairs, 2620 based on Foata normal form. 8/40046 useless extension candidates. Maximal degree in co-relation 18664. Up to 9353 conditions per place. [2025-01-09 21:28:11,856 INFO L140 encePairwiseOnDemand]: 236/241 looper letters, 67 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2025-01-09 21:28:11,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 278 transitions, 886 flow [2025-01-09 21:28:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1177 transitions. [2025-01-09 21:28:11,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.813969571230982 [2025-01-09 21:28:11,859 INFO L175 Difference]: Start difference. First operand has 223 places, 241 transitions, 668 flow. Second operand 6 states and 1177 transitions. [2025-01-09 21:28:11,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 278 transitions, 886 flow [2025-01-09 21:28:11,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 278 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:11,884 INFO L231 Difference]: Finished difference. Result has 229 places, 243 transitions, 646 flow [2025-01-09 21:28:11,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=229, PETRI_TRANSITIONS=243} [2025-01-09 21:28:11,884 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 9 predicate places. [2025-01-09 21:28:11,884 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 243 transitions, 646 flow [2025-01-09 21:28:11,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 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:28:11,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:11,885 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] [2025-01-09 21:28:11,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:28:11,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:11,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2127555921, now seen corresponding path program 1 times [2025-01-09 21:28:11,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:11,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939501467] [2025-01-09 21:28:11,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:11,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:28:11,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:28:11,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:11,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:28:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939501467] [2025-01-09 21:28:11,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939501467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:11,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:11,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324767857] [2025-01-09 21:28:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:11,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:11,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:11,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:11,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 241 [2025-01-09 21:28:11,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 243 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:28:11,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:11,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 241 [2025-01-09 21:28:11,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:15,643 INFO L124 PetriNetUnfolderBase]: 12897/52118 cut-off events. [2025-01-09 21:28:15,644 INFO L125 PetriNetUnfolderBase]: For 920/1543 co-relation queries the response was YES. [2025-01-09 21:28:16,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77518 conditions, 52118 events. 12897/52118 cut-off events. For 920/1543 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 723001 event pairs, 6795 based on Foata normal form. 25/45949 useless extension candidates. Maximal degree in co-relation 77411. Up to 12906 conditions per place. [2025-01-09 21:28:16,131 INFO L140 encePairwiseOnDemand]: 230/241 looper letters, 58 selfloop transitions, 9 changer transitions 0/271 dead transitions. [2025-01-09 21:28:16,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 271 transitions, 838 flow [2025-01-09 21:28:16,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2025-01-09 21:28:16,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464730290456431 [2025-01-09 21:28:16,133 INFO L175 Difference]: Start difference. First operand has 229 places, 243 transitions, 646 flow. Second operand 3 states and 612 transitions. [2025-01-09 21:28:16,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 271 transitions, 838 flow [2025-01-09 21:28:16,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 271 transitions, 832 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:16,143 INFO L231 Difference]: Finished difference. Result has 230 places, 248 transitions, 700 flow [2025-01-09 21:28:16,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=230, PETRI_TRANSITIONS=248} [2025-01-09 21:28:16,143 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 10 predicate places. [2025-01-09 21:28:16,144 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 248 transitions, 700 flow [2025-01-09 21:28:16,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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:28:16,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:16,144 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 21:28:16,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:28:16,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:16,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash -339712237, now seen corresponding path program 1 times [2025-01-09 21:28:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:16,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650805904] [2025-01-09 21:28:16,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:16,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:16,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:28:16,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:28:16,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:16,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:16,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:28:16,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:28:16,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:28:16,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:16,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:16,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:28:16,178 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:28:16,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-01-09 21:28:16,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-01-09 21:28:16,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:28:16,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:28:16,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:28:16,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:28:16,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:28:16,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:28:16,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:28:16,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:28:16,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:28:16,180 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:28:16,181 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:28:16,181 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:28:16,206 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:28:16,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 297 transitions, 621 flow [2025-01-09 21:28:16,266 INFO L124 PetriNetUnfolderBase]: 69/685 cut-off events. [2025-01-09 21:28:16,267 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:28:16,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 685 events. 69/685 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3192 event pairs, 1 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 470. Up to 12 conditions per place. [2025-01-09 21:28:16,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 297 transitions, 621 flow [2025-01-09 21:28:16,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 297 transitions, 621 flow [2025-01-09 21:28:16,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:16,277 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;@67ce0acf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:16,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-01-09 21:28:16,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:16,280 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-09 21:28:16,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:16,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:16,280 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] [2025-01-09 21:28:16,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:28:16,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash -766268410, now seen corresponding path program 1 times [2025-01-09 21:28:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:16,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861111008] [2025-01-09 21:28:16,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:16,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:28:16,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:28:16,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:16,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:16,301 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:28:16,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:16,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861111008] [2025-01-09 21:28:16,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861111008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:16,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:16,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318288370] [2025-01-09 21:28:16,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:16,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:16,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:16,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:16,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:16,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 297 [2025-01-09 21:28:16,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 297 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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:28:16,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:16,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 297 [2025-01-09 21:28:16,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:22,650 INFO L124 PetriNetUnfolderBase]: 20295/73408 cut-off events. [2025-01-09 21:28:22,650 INFO L125 PetriNetUnfolderBase]: For 1223/1288 co-relation queries the response was YES. [2025-01-09 21:28:23,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101109 conditions, 73408 events. 20295/73408 cut-off events. For 1223/1288 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 1037860 event pairs, 12300 based on Foata normal form. 14975/79876 useless extension candidates. Maximal degree in co-relation 12982. Up to 27148 conditions per place. [2025-01-09 21:28:23,315 INFO L140 encePairwiseOnDemand]: 266/297 looper letters, 47 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-01-09 21:28:23,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 275 transitions, 675 flow [2025-01-09 21:28:23,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2025-01-09 21:28:23,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8585858585858586 [2025-01-09 21:28:23,317 INFO L175 Difference]: Start difference. First operand has 270 places, 297 transitions, 621 flow. Second operand 3 states and 765 transitions. [2025-01-09 21:28:23,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 275 transitions, 675 flow [2025-01-09 21:28:23,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 275 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:23,320 INFO L231 Difference]: Finished difference. Result has 271 places, 268 transitions, 573 flow [2025-01-09 21:28:23,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=271, PETRI_TRANSITIONS=268} [2025-01-09 21:28:23,321 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, 1 predicate places. [2025-01-09 21:28:23,321 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 268 transitions, 573 flow [2025-01-09 21:28:23,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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:28:23,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:23,322 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] [2025-01-09 21:28:23,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:28:23,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:28:23,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:23,322 INFO L85 PathProgramCache]: Analyzing trace with hash 128672424, now seen corresponding path program 1 times [2025-01-09 21:28:23,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:23,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391316483] [2025-01-09 21:28:23,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:23,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:23,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:28:23,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:28:23,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:23,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:23,458 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:28:23,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:23,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391316483] [2025-01-09 21:28:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391316483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:23,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:23,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:23,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534923040] [2025-01-09 21:28:23,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:23,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:23,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:23,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:23,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:23,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 297 [2025-01-09 21:28:23,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 268 transitions, 573 flow. Second operand has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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:28:23,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:23,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 297 [2025-01-09 21:28:23,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:33,137 INFO L124 PetriNetUnfolderBase]: 35386/97480 cut-off events. [2025-01-09 21:28:33,137 INFO L125 PetriNetUnfolderBase]: For 2278/2278 co-relation queries the response was YES. [2025-01-09 21:28:33,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148520 conditions, 97480 events. 35386/97480 cut-off events. For 2278/2278 co-relation queries the response was YES. Maximal size of possible extension queue 1911. Compared 1305651 event pairs, 15132 based on Foata normal form. 0/90098 useless extension candidates. Maximal degree in co-relation 129911. Up to 37886 conditions per place. [2025-01-09 21:28:33,809 INFO L140 encePairwiseOnDemand]: 291/297 looper letters, 131 selfloop transitions, 6 changer transitions 0/351 dead transitions. [2025-01-09 21:28:33,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 351 transitions, 1013 flow [2025-01-09 21:28:33,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1427 transitions. [2025-01-09 21:28:33,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8007856341189674 [2025-01-09 21:28:33,813 INFO L175 Difference]: Start difference. First operand has 271 places, 268 transitions, 573 flow. Second operand 6 states and 1427 transitions. [2025-01-09 21:28:33,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 351 transitions, 1013 flow [2025-01-09 21:28:33,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 351 transitions, 1011 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:33,821 INFO L231 Difference]: Finished difference. Result has 274 places, 267 transitions, 581 flow [2025-01-09 21:28:33,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=581, PETRI_PLACES=274, PETRI_TRANSITIONS=267} [2025-01-09 21:28:33,822 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, 4 predicate places. [2025-01-09 21:28:33,822 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 267 transitions, 581 flow [2025-01-09 21:28:33,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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:28:33,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:33,823 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] [2025-01-09 21:28:33,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:28:33,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:28:33,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:33,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1131286668, now seen corresponding path program 1 times [2025-01-09 21:28:33,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:33,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436162364] [2025-01-09 21:28:33,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:33,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:28:33,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:28:33,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:33,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:33,843 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:28:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436162364] [2025-01-09 21:28:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436162364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:33,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:33,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233847462] [2025-01-09 21:28:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:33,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:33,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:33,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:33,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 297 [2025-01-09 21:28:33,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 267 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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:28:33,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:33,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 297 [2025-01-09 21:28:33,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand