./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/reorder_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/pthread/reorder_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 eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:02:27,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:02:27,645 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:02:27,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:02:27,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:02:27,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:02:27,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:02:27,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:02:27,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:02:27,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:02:27,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:02:27,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:02:27,677 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:02:27,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:02:27,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:02:27,677 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:02:27,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:02:27,678 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:02:27,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:02:27,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:27,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:02:27,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:02:27,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:02:27,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:27,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:02:27,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:02:27,680 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:02:27,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:02:27,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:02:27,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:02:27,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:02:27,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:02:27,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:02:27,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:02:27,680 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 -> eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 [2025-01-09 21:02:27,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:02:27,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:02:27,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:02:27,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:02:27,913 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:02:27,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_2.i [2025-01-09 21:02:29,057 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db9c2a4b8/39fc9fea31564189a5a01d3298e23457/FLAGbb4daba32 [2025-01-09 21:02:29,396 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:02:29,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/reorder_2.i [2025-01-09 21:02:29,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db9c2a4b8/39fc9fea31564189a5a01d3298e23457/FLAGbb4daba32 [2025-01-09 21:02:29,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db9c2a4b8/39fc9fea31564189a5a01d3298e23457 [2025-01-09 21:02:29,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:02:29,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:02:29,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:02:29,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:02:29,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:02:29,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:29" (1/1) ... [2025-01-09 21:02:29,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b9ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:29, skipping insertion in model container [2025-01-09 21:02:29,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:29" (1/1) ... [2025-01-09 21:02:29,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:02:30,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:02:30,094 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:02:30,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:02:30,185 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:02:30,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30 WrapperNode [2025-01-09 21:02:30,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:02:30,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:02:30,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:02:30,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:02:30,195 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:02:30" (1/1) ... [2025-01-09 21:02:30,211 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:02:30" (1/1) ... [2025-01-09 21:02:30,228 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2025-01-09 21:02:30,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:02:30,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:02:30,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:02:30,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:02:30,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (1/1) ... [2025-01-09 21:02:30,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (1/1) ... [2025-01-09 21:02:30,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (1/1) ... [2025-01-09 21:02:30,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (1/1) ... [2025-01-09 21:02:30,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (1/1) ... [2025-01-09 21:02:30,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (1/1) ... [2025-01-09 21:02:30,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (1/1) ... [2025-01-09 21:02:30,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (1/1) ... [2025-01-09 21:02:30,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (1/1) ... [2025-01-09 21:02:30,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:02:30,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:02:30,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:02:30,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:02:30,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (1/1) ... [2025-01-09 21:02:30,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:30,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:02:30,305 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:02:30,307 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:02:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:02:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:02:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:02:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:02:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:02:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-01-09 21:02:30,323 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-01-09 21:02:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:02:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:02:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-01-09 21:02:30,324 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-01-09 21:02:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:02:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:02:30,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:02:30,325 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:02:30,446 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:02:30,448 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:02:30,750 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:02:30,750 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:02:30,769 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:02:30,769 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:02:30,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:30 BoogieIcfgContainer [2025-01-09 21:02:30,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:02:30,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:02:30,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:02:30,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:02:30,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:02:29" (1/3) ... [2025-01-09 21:02:30,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3070a1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:30, skipping insertion in model container [2025-01-09 21:02:30,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:30" (2/3) ... [2025-01-09 21:02:30,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3070a1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:30, skipping insertion in model container [2025-01-09 21:02:30,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:30" (3/3) ... [2025-01-09 21:02:30,776 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2025-01-09 21:02:30,786 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:02:30,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_2.i that has 3 procedures, 226 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-01-09 21:02:30,787 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:02:30,841 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:02:30,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 245 transitions, 510 flow [2025-01-09 21:02:30,969 INFO L124 PetriNetUnfolderBase]: 39/521 cut-off events. [2025-01-09 21:02:30,971 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:02:30,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 521 events. 39/521 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2086 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 277. Up to 8 conditions per place. [2025-01-09 21:02:30,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 245 transitions, 510 flow [2025-01-09 21:02:30,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 245 transitions, 510 flow [2025-01-09 21:02:30,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:02:31,012 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;@2df1d2fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:02:31,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-01-09 21:02:31,019 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:02:31,019 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:02:31,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:31,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:31,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:31,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1022639801, now seen corresponding path program 1 times [2025-01-09 21:02:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:31,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988825678] [2025-01-09 21:02:31,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:31,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:31,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 21:02:31,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 21:02:31,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:31,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:31,206 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:02:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988825678] [2025-01-09 21:02:31,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988825678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:31,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:31,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:31,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101551016] [2025-01-09 21:02:31,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:31,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:31,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:31,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:31,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 245 [2025-01-09 21:02:31,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 245 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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:02:31,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:31,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 245 [2025-01-09 21:02:31,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:31,389 INFO L124 PetriNetUnfolderBase]: 63/811 cut-off events. [2025-01-09 21:02:31,389 INFO L125 PetriNetUnfolderBase]: For 72/124 co-relation queries the response was YES. [2025-01-09 21:02:31,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 811 events. 63/811 cut-off events. For 72/124 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4145 event pairs, 50 based on Foata normal form. 67/749 useless extension candidates. Maximal degree in co-relation 575. Up to 128 conditions per place. [2025-01-09 21:02:31,397 INFO L140 encePairwiseOnDemand]: 224/245 looper letters, 18 selfloop transitions, 1 changer transitions 6/223 dead transitions. [2025-01-09 21:02:31,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 223 transitions, 504 flow [2025-01-09 21:02:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2025-01-09 21:02:31,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.889795918367347 [2025-01-09 21:02:31,416 INFO L175 Difference]: Start difference. First operand has 232 places, 245 transitions, 510 flow. Second operand 3 states and 654 transitions. [2025-01-09 21:02:31,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 223 transitions, 504 flow [2025-01-09 21:02:31,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 223 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:31,426 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 456 flow [2025-01-09 21:02:31,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2025-01-09 21:02:31,430 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -8 predicate places. [2025-01-09 21:02:31,432 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 456 flow [2025-01-09 21:02:31,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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:02:31,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:31,433 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] [2025-01-09 21:02:31,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:02:31,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:31,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1637127326, now seen corresponding path program 1 times [2025-01-09 21:02:31,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:31,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670378436] [2025-01-09 21:02:31,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:31,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:31,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:02:31,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:02:31,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:31,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:31,537 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:02:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:31,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670378436] [2025-01-09 21:02:31,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670378436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:31,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:31,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:31,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938783025] [2025-01-09 21:02:31,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:31,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:31,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:31,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:31,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:31,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 245 [2025-01-09 21:02:31,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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:02:31,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:31,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 245 [2025-01-09 21:02:31,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:31,733 INFO L124 PetriNetUnfolderBase]: 60/1400 cut-off events. [2025-01-09 21:02:31,733 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-01-09 21:02:31,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1400 events. 60/1400 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8876 event pairs, 28 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 754. Up to 51 conditions per place. [2025-01-09 21:02:31,737 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 21 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2025-01-09 21:02:31,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 226 transitions, 536 flow [2025-01-09 21:02:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2025-01-09 21:02:31,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908843537414966 [2025-01-09 21:02:31,739 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 456 flow. Second operand 3 states and 668 transitions. [2025-01-09 21:02:31,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 226 transitions, 536 flow [2025-01-09 21:02:31,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 226 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:31,743 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 455 flow [2025-01-09 21:02:31,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2025-01-09 21:02:31,743 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -14 predicate places. [2025-01-09 21:02:31,743 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 455 flow [2025-01-09 21:02:31,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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:02:31,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:31,744 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] [2025-01-09 21:02:31,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:02:31,744 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:31,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash 788601481, now seen corresponding path program 1 times [2025-01-09 21:02:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:31,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415698538] [2025-01-09 21:02:31,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:31,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:31,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:02:31,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:02:31,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:31,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:31,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:02:31,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:31,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415698538] [2025-01-09 21:02:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415698538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:31,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:31,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808869403] [2025-01-09 21:02:31,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:31,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:31,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:31,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:31,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 245 [2025-01-09 21:02:31,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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:02:31,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:31,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 245 [2025-01-09 21:02:31,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:31,921 INFO L124 PetriNetUnfolderBase]: 232/1701 cut-off events. [2025-01-09 21:02:31,921 INFO L125 PetriNetUnfolderBase]: For 154/458 co-relation queries the response was YES. [2025-01-09 21:02:31,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 1701 events. 232/1701 cut-off events. For 154/458 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11207 event pairs, 52 based on Foata normal form. 19/1513 useless extension candidates. Maximal degree in co-relation 1112. Up to 355 conditions per place. [2025-01-09 21:02:31,927 INFO L140 encePairwiseOnDemand]: 233/245 looper letters, 15 selfloop transitions, 1 changer transitions 24/220 dead transitions. [2025-01-09 21:02:31,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 529 flow [2025-01-09 21:02:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-01-09 21:02:31,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8653061224489796 [2025-01-09 21:02:31,933 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 455 flow. Second operand 3 states and 636 transitions. [2025-01-09 21:02:31,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 529 flow [2025-01-09 21:02:31,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:31,936 INFO L231 Difference]: Finished difference. Result has 213 places, 192 transitions, 408 flow [2025-01-09 21:02:31,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=213, PETRI_TRANSITIONS=192} [2025-01-09 21:02:31,937 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -19 predicate places. [2025-01-09 21:02:31,937 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 192 transitions, 408 flow [2025-01-09 21:02:31,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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:02:31,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:31,938 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] [2025-01-09 21:02:31,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:02:31,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:31,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:31,939 INFO L85 PathProgramCache]: Analyzing trace with hash -370393915, now seen corresponding path program 1 times [2025-01-09 21:02:31,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:31,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466467] [2025-01-09 21:02:31,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:31,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:31,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:02:31,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:02:31,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:31,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:31,964 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:02:31,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:31,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466467] [2025-01-09 21:02:31,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:31,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:31,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:31,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583361054] [2025-01-09 21:02:31,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:31,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:31,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:31,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:31,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:31,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 245 [2025-01-09 21:02:31,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 192 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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:02:31,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:31,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 245 [2025-01-09 21:02:31,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:32,115 INFO L124 PetriNetUnfolderBase]: 184/1638 cut-off events. [2025-01-09 21:02:32,116 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-01-09 21:02:32,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 1638 events. 184/1638 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11141 event pairs, 156 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 1838. Up to 362 conditions per place. [2025-01-09 21:02:32,124 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 18 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2025-01-09 21:02:32,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 189 transitions, 442 flow [2025-01-09 21:02:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2025-01-09 21:02:32,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693877551020408 [2025-01-09 21:02:32,129 INFO L175 Difference]: Start difference. First operand has 213 places, 192 transitions, 408 flow. Second operand 3 states and 639 transitions. [2025-01-09 21:02:32,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 189 transitions, 442 flow [2025-01-09 21:02:32,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 189 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:32,137 INFO L231 Difference]: Finished difference. Result has 193 places, 189 transitions, 409 flow [2025-01-09 21:02:32,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=409, PETRI_PLACES=193, PETRI_TRANSITIONS=189} [2025-01-09 21:02:32,138 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -39 predicate places. [2025-01-09 21:02:32,138 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 189 transitions, 409 flow [2025-01-09 21:02:32,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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:02:32,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:32,138 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] [2025-01-09 21:02:32,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:02:32,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:32,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash 23496041, now seen corresponding path program 1 times [2025-01-09 21:02:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:32,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568286473] [2025-01-09 21:02:32,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:32,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:32,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:02:32,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:02:32,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:32,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:32,183 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:02:32,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:32,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568286473] [2025-01-09 21:02:32,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568286473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:32,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:32,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:32,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488390721] [2025-01-09 21:02:32,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:32,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:32,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:32,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:32,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2025-01-09 21:02:32,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 189 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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:02:32,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:32,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2025-01-09 21:02:32,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:32,337 INFO L124 PetriNetUnfolderBase]: 124/1385 cut-off events. [2025-01-09 21:02:32,338 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-01-09 21:02:32,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 1385 events. 124/1385 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8864 event pairs, 96 based on Foata normal form. 0/1196 useless extension candidates. Maximal degree in co-relation 868. Up to 250 conditions per place. [2025-01-09 21:02:32,342 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 17 selfloop transitions, 2 changer transitions 3/188 dead transitions. [2025-01-09 21:02:32,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 188 transitions, 447 flow [2025-01-09 21:02:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-01-09 21:02:32,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2025-01-09 21:02:32,348 INFO L175 Difference]: Start difference. First operand has 193 places, 189 transitions, 409 flow. Second operand 3 states and 642 transitions. [2025-01-09 21:02:32,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 188 transitions, 447 flow [2025-01-09 21:02:32,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 188 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:32,352 INFO L231 Difference]: Finished difference. Result has 194 places, 185 transitions, 405 flow [2025-01-09 21:02:32,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=194, PETRI_TRANSITIONS=185} [2025-01-09 21:02:32,355 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -38 predicate places. [2025-01-09 21:02:32,355 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 185 transitions, 405 flow [2025-01-09 21:02:32,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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:02:32,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:32,355 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] [2025-01-09 21:02:32,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:02:32,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:32,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash 195387245, now seen corresponding path program 1 times [2025-01-09 21:02:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:32,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636995113] [2025-01-09 21:02:32,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:32,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:32,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:02:32,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:02:32,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:32,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:32,431 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:02:32,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636995113] [2025-01-09 21:02:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636995113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:32,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:32,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032952901] [2025-01-09 21:02:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:32,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:32,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:32,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:32,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 245 [2025-01-09 21:02:32,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 185 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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:02:32,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:32,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 245 [2025-01-09 21:02:32,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:32,541 INFO L124 PetriNetUnfolderBase]: 60/1200 cut-off events. [2025-01-09 21:02:32,542 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-01-09 21:02:32,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 1200 events. 60/1200 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7075 event pairs, 28 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 696. Up to 51 conditions per place. [2025-01-09 21:02:32,546 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 21 selfloop transitions, 1 changer transitions 0/194 dead transitions. [2025-01-09 21:02:32,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 194 transitions, 485 flow [2025-01-09 21:02:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2025-01-09 21:02:32,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908843537414966 [2025-01-09 21:02:32,549 INFO L175 Difference]: Start difference. First operand has 194 places, 185 transitions, 405 flow. Second operand 3 states and 668 transitions. [2025-01-09 21:02:32,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 194 transitions, 485 flow [2025-01-09 21:02:32,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 194 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:32,551 INFO L231 Difference]: Finished difference. Result has 190 places, 184 transitions, 401 flow [2025-01-09 21:02:32,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=190, PETRI_TRANSITIONS=184} [2025-01-09 21:02:32,552 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -42 predicate places. [2025-01-09 21:02:32,552 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 184 transitions, 401 flow [2025-01-09 21:02:32,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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:02:32,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:32,553 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] [2025-01-09 21:02:32,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:02:32,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:32,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1755061783, now seen corresponding path program 1 times [2025-01-09 21:02:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:32,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165627434] [2025-01-09 21:02:32,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:32,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:32,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:02:32,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:02:32,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:32,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:32,576 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:02:32,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:32,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165627434] [2025-01-09 21:02:32,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165627434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:32,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:32,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23797471] [2025-01-09 21:02:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:32,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:32,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:32,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:32,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2025-01-09 21:02:32,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 184 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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:02:32,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:32,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2025-01-09 21:02:32,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:32,724 INFO L124 PetriNetUnfolderBase]: 120/1323 cut-off events. [2025-01-09 21:02:32,724 INFO L125 PetriNetUnfolderBase]: For 118/238 co-relation queries the response was YES. [2025-01-09 21:02:32,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 1323 events. 120/1323 cut-off events. For 118/238 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8420 event pairs, 92 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 835. Up to 234 conditions per place. [2025-01-09 21:02:32,728 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 18 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-01-09 21:02:32,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 183 transitions, 439 flow [2025-01-09 21:02:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2025-01-09 21:02:32,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8721088435374149 [2025-01-09 21:02:32,732 INFO L175 Difference]: Start difference. First operand has 190 places, 184 transitions, 401 flow. Second operand 3 states and 641 transitions. [2025-01-09 21:02:32,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 183 transitions, 439 flow [2025-01-09 21:02:32,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 183 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:32,735 INFO L231 Difference]: Finished difference. Result has 190 places, 183 transitions, 402 flow [2025-01-09 21:02:32,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=190, PETRI_TRANSITIONS=183} [2025-01-09 21:02:32,736 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -42 predicate places. [2025-01-09 21:02:32,736 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 183 transitions, 402 flow [2025-01-09 21:02:32,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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:02:32,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:32,737 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] [2025-01-09 21:02:32,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:02:32,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:32,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:32,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1191961488, now seen corresponding path program 1 times [2025-01-09 21:02:32,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:32,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725219047] [2025-01-09 21:02:32,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:32,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:02:32,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:02:32,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:32,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:32,771 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:02:32,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:32,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725219047] [2025-01-09 21:02:32,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725219047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:32,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:32,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:02:32,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656941464] [2025-01-09 21:02:32,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:32,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:32,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:32,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:32,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:32,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 245 [2025-01-09 21:02:32,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 183 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 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:02:32,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:32,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 245 [2025-01-09 21:02:32,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:32,876 INFO L124 PetriNetUnfolderBase]: 58/1187 cut-off events. [2025-01-09 21:02:32,877 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-01-09 21:02:32,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1187 events. 58/1187 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6977 event pairs, 28 based on Foata normal form. 2/1046 useless extension candidates. Maximal degree in co-relation 706. Up to 110 conditions per place. [2025-01-09 21:02:32,881 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 16 selfloop transitions, 0 changer transitions 1/182 dead transitions. [2025-01-09 21:02:32,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 182 transitions, 431 flow [2025-01-09 21:02:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-01-09 21:02:32,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2025-01-09 21:02:32,883 INFO L175 Difference]: Start difference. First operand has 190 places, 183 transitions, 402 flow. Second operand 3 states and 642 transitions. [2025-01-09 21:02:32,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 182 transitions, 431 flow [2025-01-09 21:02:32,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 182 transitions, 423 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-09 21:02:32,886 INFO L231 Difference]: Finished difference. Result has 189 places, 181 transitions, 389 flow [2025-01-09 21:02:32,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=189, PETRI_TRANSITIONS=181} [2025-01-09 21:02:32,887 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -43 predicate places. [2025-01-09 21:02:32,887 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 181 transitions, 389 flow [2025-01-09 21:02:32,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 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:02:32,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:32,887 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] [2025-01-09 21:02:32,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:02:32,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:32,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:32,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1851707965, now seen corresponding path program 1 times [2025-01-09 21:02:32,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:32,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146077702] [2025-01-09 21:02:32,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:32,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:32,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:02:32,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:02:32,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:32,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:33,342 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:02:33,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:33,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146077702] [2025-01-09 21:02:33,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146077702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:02:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013450850] [2025-01-09 21:02:33,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:33,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:02:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:33,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:02:33,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:02:33,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 245 [2025-01-09 21:02:33,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 181 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 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:02:33,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:33,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 245 [2025-01-09 21:02:33,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:33,806 INFO L124 PetriNetUnfolderBase]: 652/3659 cut-off events. [2025-01-09 21:02:33,806 INFO L125 PetriNetUnfolderBase]: For 96/106 co-relation queries the response was YES. [2025-01-09 21:02:33,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 3659 events. 652/3659 cut-off events. For 96/106 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 31652 event pairs, 296 based on Foata normal form. 0/3276 useless extension candidates. Maximal degree in co-relation 5175. Up to 1255 conditions per place. [2025-01-09 21:02:33,819 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 44 selfloop transitions, 5 changer transitions 4/188 dead transitions. [2025-01-09 21:02:33,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 188 transitions, 503 flow [2025-01-09 21:02:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:02:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:02:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1149 transitions. [2025-01-09 21:02:33,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7816326530612245 [2025-01-09 21:02:33,821 INFO L175 Difference]: Start difference. First operand has 189 places, 181 transitions, 389 flow. Second operand 6 states and 1149 transitions. [2025-01-09 21:02:33,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 188 transitions, 503 flow [2025-01-09 21:02:33,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 188 transitions, 501 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:33,824 INFO L231 Difference]: Finished difference. Result has 191 places, 176 transitions, 387 flow [2025-01-09 21:02:33,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=191, PETRI_TRANSITIONS=176} [2025-01-09 21:02:33,825 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -41 predicate places. [2025-01-09 21:02:33,825 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 176 transitions, 387 flow [2025-01-09 21:02:33,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 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:02:33,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:33,826 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] [2025-01-09 21:02:33,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:02:33,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:33,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash 722513415, now seen corresponding path program 1 times [2025-01-09 21:02:33,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:33,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032340] [2025-01-09 21:02:33,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:33,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:02:33,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:02:33,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:33,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:33,895 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:02:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032340] [2025-01-09 21:02:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:33,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:33,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:02:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634295418] [2025-01-09 21:02:33,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:33,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:02:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:33,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:02:33,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:02:33,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 245 [2025-01-09 21:02:33,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 176 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 204.5) internal successors, (818), 4 states have internal predecessors, (818), 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:02:33,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:33,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 245 [2025-01-09 21:02:33,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:34,086 INFO L124 PetriNetUnfolderBase]: 159/1512 cut-off events. [2025-01-09 21:02:34,087 INFO L125 PetriNetUnfolderBase]: For 90/192 co-relation queries the response was YES. [2025-01-09 21:02:34,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1512 events. 159/1512 cut-off events. For 90/192 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10391 event pairs, 120 based on Foata normal form. 11/1351 useless extension candidates. Maximal degree in co-relation 1963. Up to 209 conditions per place. [2025-01-09 21:02:34,093 INFO L140 encePairwiseOnDemand]: 233/245 looper letters, 42 selfloop transitions, 10 changer transitions 0/204 dead transitions. [2025-01-09 21:02:34,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 204 transitions, 571 flow [2025-01-09 21:02:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:02:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:02:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 866 transitions. [2025-01-09 21:02:34,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8836734693877552 [2025-01-09 21:02:34,095 INFO L175 Difference]: Start difference. First operand has 191 places, 176 transitions, 387 flow. Second operand 4 states and 866 transitions. [2025-01-09 21:02:34,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 204 transitions, 571 flow [2025-01-09 21:02:34,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 204 transitions, 561 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:02:34,098 INFO L231 Difference]: Finished difference. Result has 187 places, 184 transitions, 451 flow [2025-01-09 21:02:34,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=187, PETRI_TRANSITIONS=184} [2025-01-09 21:02:34,099 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -45 predicate places. [2025-01-09 21:02:34,099 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 184 transitions, 451 flow [2025-01-09 21:02:34,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 204.5) internal successors, (818), 4 states have internal predecessors, (818), 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:02:34,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:34,100 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:34,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:02:34,100 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:34,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1078954853, now seen corresponding path program 1 times [2025-01-09 21:02:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:34,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516888737] [2025-01-09 21:02:34,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:34,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:02:34,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:02:34,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:34,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:02:34,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:02:34,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:02:34,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:02:34,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:34,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:02:34,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:02:34,174 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:02:34,174 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-01-09 21:02:34,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-01-09 21:02:34,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-01-09 21:02:34,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-01-09 21:02:34,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-01-09 21:02:34,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-01-09 21:02:34,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2025-01-09 21:02:34,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-01-09 21:02:34,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-01-09 21:02:34,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-01-09 21:02:34,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:02:34,182 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:34,183 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:02:34,183 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:02:34,226 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-09 21:02:34,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 278 transitions, 600 flow [2025-01-09 21:02:34,318 INFO L124 PetriNetUnfolderBase]: 155/1630 cut-off events. [2025-01-09 21:02:34,318 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-09 21:02:34,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 1630 events. 155/1630 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9465 event pairs, 1 based on Foata normal form. 0/1331 useless extension candidates. Maximal degree in co-relation 942. Up to 32 conditions per place. [2025-01-09 21:02:34,325 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 278 transitions, 600 flow [2025-01-09 21:02:34,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 278 transitions, 600 flow [2025-01-09 21:02:34,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:02:34,333 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;@2df1d2fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:02:34,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-09 21:02:34,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:02:34,335 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:02:34,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:34,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:34,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:34,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:34,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash 370138075, now seen corresponding path program 1 times [2025-01-09 21:02:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:34,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374624194] [2025-01-09 21:02:34,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:34,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 21:02:34,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 21:02:34,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:34,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:34,350 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:02:34,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:34,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374624194] [2025-01-09 21:02:34,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374624194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:34,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:34,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:34,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045829516] [2025-01-09 21:02:34,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:34,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:34,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:34,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:34,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:34,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 278 [2025-01-09 21:02:34,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 278 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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:02:34,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:34,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 278 [2025-01-09 21:02:34,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:35,265 INFO L124 PetriNetUnfolderBase]: 2218/10556 cut-off events. [2025-01-09 21:02:35,266 INFO L125 PetriNetUnfolderBase]: For 2575/5644 co-relation queries the response was YES. [2025-01-09 21:02:35,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14543 conditions, 10556 events. 2218/10556 cut-off events. For 2575/5644 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 112662 event pairs, 1905 based on Foata normal form. 1203/10033 useless extension candidates. Maximal degree in co-relation 9437. Up to 3249 conditions per place. [2025-01-09 21:02:35,334 INFO L140 encePairwiseOnDemand]: 251/278 looper letters, 28 selfloop transitions, 1 changer transitions 4/248 dead transitions. [2025-01-09 21:02:35,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 248 transitions, 598 flow [2025-01-09 21:02:35,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-01-09 21:02:35,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8609112709832134 [2025-01-09 21:02:35,337 INFO L175 Difference]: Start difference. First operand has 263 places, 278 transitions, 600 flow. Second operand 3 states and 718 transitions. [2025-01-09 21:02:35,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 248 transitions, 598 flow [2025-01-09 21:02:35,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 248 transitions, 598 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:35,344 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 534 flow [2025-01-09 21:02:35,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2025-01-09 21:02:35,346 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -14 predicate places. [2025-01-09 21:02:35,346 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 534 flow [2025-01-09 21:02:35,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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:02:35,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:35,347 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] [2025-01-09 21:02:35,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:02:35,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:35,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1410685854, now seen corresponding path program 1 times [2025-01-09 21:02:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:35,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719533209] [2025-01-09 21:02:35,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:35,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:35,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:02:35,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:02:35,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:35,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:35,376 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:02:35,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:35,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719533209] [2025-01-09 21:02:35,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719533209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:35,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:35,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:35,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83434958] [2025-01-09 21:02:35,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:35,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:35,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:35,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:35,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:35,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 278 [2025-01-09 21:02:35,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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:02:35,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:35,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 278 [2025-01-09 21:02:35,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:37,202 INFO L124 PetriNetUnfolderBase]: 2492/17972 cut-off events. [2025-01-09 21:02:37,202 INFO L125 PetriNetUnfolderBase]: For 5100/26976 co-relation queries the response was YES. [2025-01-09 21:02:37,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22939 conditions, 17972 events. 2492/17972 cut-off events. For 5100/26976 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 225894 event pairs, 1706 based on Foata normal form. 0/14727 useless extension candidates. Maximal degree in co-relation 11439. Up to 1670 conditions per place. [2025-01-09 21:02:37,312 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 41 selfloop transitions, 1 changer transitions 0/263 dead transitions. [2025-01-09 21:02:37,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 263 transitions, 696 flow [2025-01-09 21:02:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2025-01-09 21:02:37,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.882494004796163 [2025-01-09 21:02:37,315 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 534 flow. Second operand 3 states and 736 transitions. [2025-01-09 21:02:37,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 263 transitions, 696 flow [2025-01-09 21:02:37,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 263 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:37,320 INFO L231 Difference]: Finished difference. Result has 245 places, 243 transitions, 533 flow [2025-01-09 21:02:37,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=245, PETRI_TRANSITIONS=243} [2025-01-09 21:02:37,321 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -18 predicate places. [2025-01-09 21:02:37,321 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 243 transitions, 533 flow [2025-01-09 21:02:37,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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:02:37,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:37,321 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] [2025-01-09 21:02:37,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:02:37,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:37,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash -781647203, now seen corresponding path program 1 times [2025-01-09 21:02:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:37,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220687660] [2025-01-09 21:02:37,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:37,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:02:37,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:02:37,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:37,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:37,339 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:02:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220687660] [2025-01-09 21:02:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220687660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:37,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:37,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659643009] [2025-01-09 21:02:37,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:37,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:37,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:37,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:37,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 278 [2025-01-09 21:02:37,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 243 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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:02:37,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:37,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 278 [2025-01-09 21:02:37,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:40,863 INFO L124 PetriNetUnfolderBase]: 14770/42295 cut-off events. [2025-01-09 21:02:40,863 INFO L125 PetriNetUnfolderBase]: For 9682/47838 co-relation queries the response was YES. [2025-01-09 21:02:40,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66234 conditions, 42295 events. 14770/42295 cut-off events. For 9682/47838 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 494853 event pairs, 4272 based on Foata normal form. 121/37321 useless extension candidates. Maximal degree in co-relation 33113. Up to 17809 conditions per place. [2025-01-09 21:02:41,076 INFO L140 encePairwiseOnDemand]: 264/278 looper letters, 41 selfloop transitions, 2 changer transitions 18/258 dead transitions. [2025-01-09 21:02:41,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 258 transitions, 702 flow [2025-01-09 21:02:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-01-09 21:02:41,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8405275779376499 [2025-01-09 21:02:41,078 INFO L175 Difference]: Start difference. First operand has 245 places, 243 transitions, 533 flow. Second operand 3 states and 701 transitions. [2025-01-09 21:02:41,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 258 transitions, 702 flow [2025-01-09 21:02:41,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 258 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:41,084 INFO L231 Difference]: Finished difference. Result has 240 places, 223 transitions, 502 flow [2025-01-09 21:02:41,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=240, PETRI_TRANSITIONS=223} [2025-01-09 21:02:41,085 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -23 predicate places. [2025-01-09 21:02:41,085 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 223 transitions, 502 flow [2025-01-09 21:02:41,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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:02:41,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:41,086 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] [2025-01-09 21:02:41,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:02:41,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:41,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1845849511, now seen corresponding path program 1 times [2025-01-09 21:02:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:41,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711527596] [2025-01-09 21:02:41,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:41,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:02:41,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:02:41,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:41,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:41,108 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:02:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711527596] [2025-01-09 21:02:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711527596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861783287] [2025-01-09 21:02:41,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:41,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:41,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:41,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 278 [2025-01-09 21:02:41,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 223 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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:02:41,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:41,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 278 [2025-01-09 21:02:41,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:42,931 INFO L124 PetriNetUnfolderBase]: 6096/23780 cut-off events. [2025-01-09 21:02:42,931 INFO L125 PetriNetUnfolderBase]: For 4710/11250 co-relation queries the response was YES. [2025-01-09 21:02:42,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35749 conditions, 23780 events. 6096/23780 cut-off events. For 4710/11250 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 277109 event pairs, 5210 based on Foata normal form. 0/21026 useless extension candidates. Maximal degree in co-relation 28670. Up to 8524 conditions per place. [2025-01-09 21:02:43,066 INFO L140 encePairwiseOnDemand]: 272/278 looper letters, 28 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-01-09 21:02:43,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 220 transitions, 556 flow [2025-01-09 21:02:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions. [2025-01-09 21:02:43,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8357314148681055 [2025-01-09 21:02:43,070 INFO L175 Difference]: Start difference. First operand has 240 places, 223 transitions, 502 flow. Second operand 3 states and 697 transitions. [2025-01-09 21:02:43,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 220 transitions, 556 flow [2025-01-09 21:02:43,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:43,076 INFO L231 Difference]: Finished difference. Result has 224 places, 220 transitions, 504 flow [2025-01-09 21:02:43,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=224, PETRI_TRANSITIONS=220} [2025-01-09 21:02:43,077 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -39 predicate places. [2025-01-09 21:02:43,077 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 220 transitions, 504 flow [2025-01-09 21:02:43,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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:02:43,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:43,077 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] [2025-01-09 21:02:43,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:02:43,078 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:43,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:43,078 INFO L85 PathProgramCache]: Analyzing trace with hash -550115203, now seen corresponding path program 1 times [2025-01-09 21:02:43,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:43,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060335570] [2025-01-09 21:02:43,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:43,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:43,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 21:02:43,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 21:02:43,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:43,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:43,093 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:02:43,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:43,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060335570] [2025-01-09 21:02:43,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060335570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:43,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:43,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:43,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066400232] [2025-01-09 21:02:43,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:43,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:43,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:43,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:43,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:43,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 278 [2025-01-09 21:02:43,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 220 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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:02:43,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:43,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 278 [2025-01-09 21:02:43,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:44,767 INFO L124 PetriNetUnfolderBase]: 4656/19695 cut-off events. [2025-01-09 21:02:44,767 INFO L125 PetriNetUnfolderBase]: For 4724/12872 co-relation queries the response was YES. [2025-01-09 21:02:44,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29201 conditions, 19695 events. 4656/19695 cut-off events. For 4724/12872 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 229164 event pairs, 3782 based on Foata normal form. 0/16702 useless extension candidates. Maximal degree in co-relation 24021. Up to 6578 conditions per place. [2025-01-09 21:02:44,870 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 28 selfloop transitions, 2 changer transitions 2/219 dead transitions. [2025-01-09 21:02:44,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 219 transitions, 562 flow [2025-01-09 21:02:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2025-01-09 21:02:44,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8393285371702638 [2025-01-09 21:02:44,872 INFO L175 Difference]: Start difference. First operand has 224 places, 220 transitions, 504 flow. Second operand 3 states and 700 transitions. [2025-01-09 21:02:44,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 219 transitions, 562 flow [2025-01-09 21:02:44,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 219 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:44,880 INFO L231 Difference]: Finished difference. Result has 225 places, 217 transitions, 502 flow [2025-01-09 21:02:44,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=225, PETRI_TRANSITIONS=217} [2025-01-09 21:02:44,880 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -38 predicate places. [2025-01-09 21:02:44,880 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 217 transitions, 502 flow [2025-01-09 21:02:44,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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:02:44,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:44,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:44,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:02:44,881 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:44,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash 600288001, now seen corresponding path program 1 times [2025-01-09 21:02:44,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:44,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448953128] [2025-01-09 21:02:44,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:44,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:44,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:02:44,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:02:44,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:44,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:44,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448953128] [2025-01-09 21:02:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448953128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:44,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580892918] [2025-01-09 21:02:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:44,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:44,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:44,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:44,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:44,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 278 [2025-01-09 21:02:44,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 217 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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:02:44,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:44,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 278 [2025-01-09 21:02:44,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:46,451 INFO L124 PetriNetUnfolderBase]: 2546/16004 cut-off events. [2025-01-09 21:02:46,451 INFO L125 PetriNetUnfolderBase]: For 5100/26976 co-relation queries the response was YES. [2025-01-09 21:02:46,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21678 conditions, 16004 events. 2546/16004 cut-off events. For 5100/26976 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 192411 event pairs, 1706 based on Foata normal form. 0/13616 useless extension candidates. Maximal degree in co-relation 19193. Up to 1670 conditions per place. [2025-01-09 21:02:46,544 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 41 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2025-01-09 21:02:46,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 236 transitions, 664 flow [2025-01-09 21:02:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2025-01-09 21:02:46,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.882494004796163 [2025-01-09 21:02:46,545 INFO L175 Difference]: Start difference. First operand has 225 places, 217 transitions, 502 flow. Second operand 3 states and 736 transitions. [2025-01-09 21:02:46,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 236 transitions, 664 flow [2025-01-09 21:02:46,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 236 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:46,550 INFO L231 Difference]: Finished difference. Result has 222 places, 216 transitions, 498 flow [2025-01-09 21:02:46,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=222, PETRI_TRANSITIONS=216} [2025-01-09 21:02:46,551 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -41 predicate places. [2025-01-09 21:02:46,551 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 216 transitions, 498 flow [2025-01-09 21:02:46,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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:02:46,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:46,552 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] [2025-01-09 21:02:46,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:02:46,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:46,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash 493939479, now seen corresponding path program 1 times [2025-01-09 21:02:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104592076] [2025-01-09 21:02:46,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:46,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:02:46,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:02:46,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:46,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:46,575 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:02:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104592076] [2025-01-09 21:02:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104592076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:46,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172124134] [2025-01-09 21:02:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:46,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:46,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:46,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 278 [2025-01-09 21:02:46,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 216 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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:02:46,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:46,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 278 [2025-01-09 21:02:46,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:48,363 INFO L124 PetriNetUnfolderBase]: 5342/21325 cut-off events. [2025-01-09 21:02:48,363 INFO L125 PetriNetUnfolderBase]: For 4762/13670 co-relation queries the response was YES. [2025-01-09 21:02:48,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31977 conditions, 21325 events. 5342/21325 cut-off events. For 4762/13670 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 250628 event pairs, 4482 based on Foata normal form. 0/18112 useless extension candidates. Maximal degree in co-relation 25846. Up to 7458 conditions per place. [2025-01-09 21:02:48,444 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 29 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2025-01-09 21:02:48,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 215 transitions, 558 flow [2025-01-09 21:02:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2025-01-09 21:02:48,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8393285371702638 [2025-01-09 21:02:48,446 INFO L175 Difference]: Start difference. First operand has 222 places, 216 transitions, 498 flow. Second operand 3 states and 700 transitions. [2025-01-09 21:02:48,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 215 transitions, 558 flow [2025-01-09 21:02:48,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 215 transitions, 557 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:48,450 INFO L231 Difference]: Finished difference. Result has 222 places, 215 transitions, 499 flow [2025-01-09 21:02:48,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=222, PETRI_TRANSITIONS=215} [2025-01-09 21:02:48,451 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -41 predicate places. [2025-01-09 21:02:48,451 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 215 transitions, 499 flow [2025-01-09 21:02:48,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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:02:48,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:48,451 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] [2025-01-09 21:02:48,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:02:48,452 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:48,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1358919696, now seen corresponding path program 1 times [2025-01-09 21:02:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:48,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167361230] [2025-01-09 21:02:48,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:48,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:02:48,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:02:48,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:48,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:48,470 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:02:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:48,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167361230] [2025-01-09 21:02:48,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167361230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:48,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:48,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:02:48,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987893877] [2025-01-09 21:02:48,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:48,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:48,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:48,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:48,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:48,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 278 [2025-01-09 21:02:48,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 215 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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:02:48,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:48,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 278 [2025-01-09 21:02:48,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:50,273 INFO L124 PetriNetUnfolderBase]: 3752/19495 cut-off events. [2025-01-09 21:02:50,274 INFO L125 PetriNetUnfolderBase]: For 5100/26976 co-relation queries the response was YES. [2025-01-09 21:02:50,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27253 conditions, 19495 events. 3752/19495 cut-off events. For 5100/26976 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 235878 event pairs, 2730 based on Foata normal form. 2/16460 useless extension candidates. Maximal degree in co-relation 23378. Up to 5036 conditions per place. [2025-01-09 21:02:50,414 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 27 selfloop transitions, 0 changer transitions 1/214 dead transitions. [2025-01-09 21:02:50,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 214 transitions, 550 flow [2025-01-09 21:02:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-01-09 21:02:50,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8405275779376499 [2025-01-09 21:02:50,420 INFO L175 Difference]: Start difference. First operand has 222 places, 215 transitions, 499 flow. Second operand 3 states and 701 transitions. [2025-01-09 21:02:50,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 214 transitions, 550 flow [2025-01-09 21:02:50,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 214 transitions, 542 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-09 21:02:50,426 INFO L231 Difference]: Finished difference. Result has 221 places, 213 transitions, 486 flow [2025-01-09 21:02:50,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=221, PETRI_TRANSITIONS=213} [2025-01-09 21:02:50,427 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -42 predicate places. [2025-01-09 21:02:50,427 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 213 transitions, 486 flow [2025-01-09 21:02:50,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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:02:50,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:50,428 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] [2025-01-09 21:02:50,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:02:50,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:50,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:50,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2131827793, now seen corresponding path program 1 times [2025-01-09 21:02:50,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:50,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062546432] [2025-01-09 21:02:50,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:50,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:02:50,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:02:50,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:50,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:50,674 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:02:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062546432] [2025-01-09 21:02:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062546432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:50,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:50,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:02:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845032028] [2025-01-09 21:02:50,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:50,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:02:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:50,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:02:50,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:02:50,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 278 [2025-01-09 21:02:50,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 213 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 200.66666666666666) internal successors, (1204), 6 states have internal predecessors, (1204), 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:02:50,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:50,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 278 [2025-01-09 21:02:50,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:56,646 INFO L124 PetriNetUnfolderBase]: 21016/72675 cut-off events. [2025-01-09 21:02:56,646 INFO L125 PetriNetUnfolderBase]: For 3154/3296 co-relation queries the response was YES. [2025-01-09 21:02:56,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111202 conditions, 72675 events. 21016/72675 cut-off events. For 3154/3296 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 962607 event pairs, 9754 based on Foata normal form. 0/66400 useless extension candidates. Maximal degree in co-relation 111193. Up to 29941 conditions per place. [2025-01-09 21:02:57,010 INFO L140 encePairwiseOnDemand]: 271/278 looper letters, 64 selfloop transitions, 5 changer transitions 3/228 dead transitions. [2025-01-09 21:02:57,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 656 flow [2025-01-09 21:02:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:02:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:02:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2025-01-09 21:02:57,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7583932853717026 [2025-01-09 21:02:57,014 INFO L175 Difference]: Start difference. First operand has 221 places, 213 transitions, 486 flow. Second operand 6 states and 1265 transitions. [2025-01-09 21:02:57,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 656 flow [2025-01-09 21:02:57,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 228 transitions, 654 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:57,023 INFO L231 Difference]: Finished difference. Result has 223 places, 209 transitions, 486 flow [2025-01-09 21:02:57,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=223, PETRI_TRANSITIONS=209} [2025-01-09 21:02:57,023 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -40 predicate places. [2025-01-09 21:02:57,023 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 209 transitions, 486 flow [2025-01-09 21:02:57,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.66666666666666) internal successors, (1204), 6 states have internal predecessors, (1204), 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:02:57,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:57,024 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] [2025-01-09 21:02:57,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:02:57,024 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:57,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1490455781, now seen corresponding path program 1 times [2025-01-09 21:02:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:57,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942193001] [2025-01-09 21:02:57,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:57,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:02:57,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:02:57,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:57,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:57,075 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:02:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942193001] [2025-01-09 21:02:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942193001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:57,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:57,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:02:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105841870] [2025-01-09 21:02:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:57,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:02:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:57,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:02:57,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:02:57,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 278 [2025-01-09 21:02:57,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 209 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 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:02:57,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:57,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 278 [2025-01-09 21:02:57,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:59,445 INFO L124 PetriNetUnfolderBase]: 7222/29018 cut-off events. [2025-01-09 21:02:59,445 INFO L125 PetriNetUnfolderBase]: For 4102/8928 co-relation queries the response was YES. [2025-01-09 21:02:59,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43101 conditions, 29018 events. 7222/29018 cut-off events. For 4102/8928 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 354321 event pairs, 5043 based on Foata normal form. 137/25717 useless extension candidates. Maximal degree in co-relation 43092. Up to 5892 conditions per place. [2025-01-09 21:02:59,590 INFO L140 encePairwiseOnDemand]: 265/278 looper letters, 77 selfloop transitions, 11 changer transitions 0/262 dead transitions. [2025-01-09 21:02:59,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 262 transitions, 832 flow [2025-01-09 21:02:59,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:02:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:02:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 966 transitions. [2025-01-09 21:02:59,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8687050359712231 [2025-01-09 21:02:59,591 INFO L175 Difference]: Start difference. First operand has 223 places, 209 transitions, 486 flow. Second operand 4 states and 966 transitions. [2025-01-09 21:02:59,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 262 transitions, 832 flow [2025-01-09 21:02:59,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 262 transitions, 822 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:02:59,597 INFO L231 Difference]: Finished difference. Result has 220 places, 218 transitions, 558 flow [2025-01-09 21:02:59,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=558, PETRI_PLACES=220, PETRI_TRANSITIONS=218} [2025-01-09 21:02:59,598 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -43 predicate places. [2025-01-09 21:02:59,598 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 558 flow [2025-01-09 21:02:59,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 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:02:59,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:59,599 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:59,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:02:59,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:59,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -233923769, now seen corresponding path program 1 times [2025-01-09 21:02:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:59,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303903429] [2025-01-09 21:02:59,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:59,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:59,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:02:59,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:02:59,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:59,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:59,697 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:02:59,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:59,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303903429] [2025-01-09 21:02:59,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303903429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:59,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:59,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:02:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859649456] [2025-01-09 21:02:59,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:59,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:02:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:59,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:02:59,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:02:59,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 278 [2025-01-09 21:02:59,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 218 transitions, 558 flow. Second operand has 6 states, 6 states have (on average 216.83333333333334) internal successors, (1301), 6 states have internal predecessors, (1301), 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:02:59,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:59,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 278 [2025-01-09 21:02:59,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:03,170 INFO L124 PetriNetUnfolderBase]: 8170/32850 cut-off events. [2025-01-09 21:03:03,171 INFO L125 PetriNetUnfolderBase]: For 7202/8788 co-relation queries the response was YES. [2025-01-09 21:03:03,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51732 conditions, 32850 events. 8170/32850 cut-off events. For 7202/8788 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 408835 event pairs, 5344 based on Foata normal form. 3/29330 useless extension candidates. Maximal degree in co-relation 51721. Up to 6739 conditions per place. [2025-01-09 21:03:03,325 INFO L140 encePairwiseOnDemand]: 262/278 looper letters, 96 selfloop transitions, 17 changer transitions 0/283 dead transitions. [2025-01-09 21:03:03,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 283 transitions, 994 flow [2025-01-09 21:03:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:03:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:03:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1619 transitions. [2025-01-09 21:03:03,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8319630010277492 [2025-01-09 21:03:03,330 INFO L175 Difference]: Start difference. First operand has 220 places, 218 transitions, 558 flow. Second operand 7 states and 1619 transitions. [2025-01-09 21:03:03,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 283 transitions, 994 flow [2025-01-09 21:03:03,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 283 transitions, 992 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:03,339 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 650 flow [2025-01-09 21:03:03,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2025-01-09 21:03:03,339 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -34 predicate places. [2025-01-09 21:03:03,340 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 650 flow [2025-01-09 21:03:03,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.83333333333334) internal successors, (1301), 6 states have internal predecessors, (1301), 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:03:03,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:03,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:03,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:03:03,340 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:03:03,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1472618474, now seen corresponding path program 1 times [2025-01-09 21:03:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286734475] [2025-01-09 21:03:03,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:03,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:03,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 21:03:03,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 21:03:03,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:03,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:03,590 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:03:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:03,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286734475] [2025-01-09 21:03:03,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286734475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:03,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:03,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:03:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088812217] [2025-01-09 21:03:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:03,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:03:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:03,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:03:03,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:03:03,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 278 [2025-01-09 21:03:03,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 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:03:03,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:03,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 278 [2025-01-09 21:03:03,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:08,599 INFO L124 PetriNetUnfolderBase]: 21085/50774 cut-off events. [2025-01-09 21:03:08,600 INFO L125 PetriNetUnfolderBase]: For 11065/11069 co-relation queries the response was YES. [2025-01-09 21:03:08,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89533 conditions, 50774 events. 21085/50774 cut-off events. For 11065/11069 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 531038 event pairs, 9342 based on Foata normal form. 0/47677 useless extension candidates. Maximal degree in co-relation 89518. Up to 25899 conditions per place. [2025-01-09 21:03:08,869 INFO L140 encePairwiseOnDemand]: 271/278 looper letters, 91 selfloop transitions, 6 changer transitions 0/255 dead transitions. [2025-01-09 21:03:08,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 255 transitions, 906 flow [2025-01-09 21:03:08,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:03:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:03:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1281 transitions. [2025-01-09 21:03:08,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7679856115107914 [2025-01-09 21:03:08,871 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 650 flow. Second operand 6 states and 1281 transitions. [2025-01-09 21:03:08,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 255 transitions, 906 flow [2025-01-09 21:03:08,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 255 transitions, 880 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-09 21:03:08,894 INFO L231 Difference]: Finished difference. Result has 230 places, 223 transitions, 634 flow [2025-01-09 21:03:08,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=230, PETRI_TRANSITIONS=223} [2025-01-09 21:03:08,894 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -33 predicate places. [2025-01-09 21:03:08,894 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 223 transitions, 634 flow [2025-01-09 21:03:08,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 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:03:08,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:08,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:08,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:03:08,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:03:08,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1833821381, now seen corresponding path program 1 times [2025-01-09 21:03:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:08,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184818790] [2025-01-09 21:03:08,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:08,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 21:03:08,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 21:03:08,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:08,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:08,943 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:03:08,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184818790] [2025-01-09 21:03:08,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184818790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:08,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:08,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:03:08,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022051579] [2025-01-09 21:03:08,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:08,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:03:08,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:08,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:03:08,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:03:09,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 278 [2025-01-09 21:03:09,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 223 transitions, 634 flow. Second operand has 5 states, 5 states have (on average 218.8) internal successors, (1094), 5 states have internal predecessors, (1094), 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:03:09,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:09,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 278 [2025-01-09 21:03:09,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand