./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/reorder_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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_5.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 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:08:59,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:09:00,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:09:00,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:09:00,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:09:00,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:09:00,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:09:00,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:09:00,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:09:00,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:09:00,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:09:00,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:09:00,092 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:09:00,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:09:00,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:09:00,092 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:09:00,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:09:00,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:09:00,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:09:00,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:09:00,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:09:00,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:09:00,093 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:09:00,093 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:09:00,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:09:00,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:09:00,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:09:00,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:09:00,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:09:00,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:09:00,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:09:00,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:00,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:09:00,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:09:00,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:09:00,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:09:00,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:09:00,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:09:00,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:09:00,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:09:00,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:09:00,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:09:00,095 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 -> 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd [2025-02-08 05:09:00,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:09:00,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:09:00,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:09:00,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:09:00,377 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:09:00,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_5.i [2025-02-08 05:09:01,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/123aa47dc/768f47add93e40378c78f954dbfeea10/FLAGe4e1dfb34 [2025-02-08 05:09:02,055 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:09:02,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/reorder_5.i [2025-02-08 05:09:02,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/123aa47dc/768f47add93e40378c78f954dbfeea10/FLAGe4e1dfb34 [2025-02-08 05:09:02,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/123aa47dc/768f47add93e40378c78f954dbfeea10 [2025-02-08 05:09:02,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:09:02,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:09:02,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:02,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:09:02,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:09:02,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345530fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02, skipping insertion in model container [2025-02-08 05:09:02,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:09:02,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:02,663 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:09:02,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:02,807 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:09:02,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02 WrapperNode [2025-02-08 05:09:02,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:02,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:02,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:09:02,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:09:02,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,849 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2025-02-08 05:09:02,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:02,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:09:02,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:09:02,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:09:02,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:09:02,885 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:09:02,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:09:02,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:09:02,886 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (1/1) ... [2025-02-08 05:09:02,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:02,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:09:02,914 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-02-08 05:09:02,916 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-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-02-08 05:09:02,933 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-02-08 05:09:02,933 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:09:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:09:02,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:09:02,934 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:09:03,049 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:09:03,051 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:09:03,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1252: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-02-08 05:09:03,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1252-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-02-08 05:09:03,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-02-08 05:09:03,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-02-08 05:09:03,421 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:09:03,421 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:09:03,460 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:09:03,460 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:09:03,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:03 BoogieIcfgContainer [2025-02-08 05:09:03,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:09:03,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:09:03,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:09:03,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:09:03,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:09:02" (1/3) ... [2025-02-08 05:09:03,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731ade12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:03, skipping insertion in model container [2025-02-08 05:09:03,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:02" (2/3) ... [2025-02-08 05:09:03,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731ade12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:03, skipping insertion in model container [2025-02-08 05:09:03,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:03" (3/3) ... [2025-02-08 05:09:03,473 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_5.i [2025-02-08 05:09:03,485 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:09:03,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_5.i that has 3 procedures, 224 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-02-08 05:09:03,486 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:09:03,554 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:09:03,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 242 transitions, 504 flow [2025-02-08 05:09:03,774 INFO L124 PetriNetUnfolderBase]: 37/514 cut-off events. [2025-02-08 05:09:03,778 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:09:03,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 514 events. 37/514 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2034 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 278. Up to 8 conditions per place. [2025-02-08 05:09:03,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 242 transitions, 504 flow [2025-02-08 05:09:03,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 242 transitions, 504 flow [2025-02-08 05:09:03,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:03,826 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;@c750384, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:03,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-02-08 05:09:03,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:03,835 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 05:09:03,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:09:03,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:03,836 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-02-08 05:09:03,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:03,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash 381077563, now seen corresponding path program 1 times [2025-02-08 05:09:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020302620] [2025-02-08 05:09:03,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:03,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:09:03,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:09:03,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:03,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020302620] [2025-02-08 05:09:04,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020302620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:04,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:04,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643399936] [2025-02-08 05:09:04,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:04,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:04,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:04,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:04,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 242 [2025-02-08 05:09:04,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 242 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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-02-08 05:09:04,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:04,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 242 [2025-02-08 05:09:04,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:04,297 INFO L124 PetriNetUnfolderBase]: 63/784 cut-off events. [2025-02-08 05:09:04,297 INFO L125 PetriNetUnfolderBase]: For 74/126 co-relation queries the response was YES. [2025-02-08 05:09:04,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 784 events. 63/784 cut-off events. For 74/126 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3946 event pairs, 50 based on Foata normal form. 53/708 useless extension candidates. Maximal degree in co-relation 557. Up to 128 conditions per place. [2025-02-08 05:09:04,306 INFO L140 encePairwiseOnDemand]: 222/242 looper letters, 18 selfloop transitions, 1 changer transitions 6/222 dead transitions. [2025-02-08 05:09:04,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 222 transitions, 502 flow [2025-02-08 05:09:04,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2025-02-08 05:09:04,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8911845730027548 [2025-02-08 05:09:04,331 INFO L175 Difference]: Start difference. First operand has 230 places, 242 transitions, 504 flow. Second operand 3 states and 647 transitions. [2025-02-08 05:09:04,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 222 transitions, 502 flow [2025-02-08 05:09:04,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 222 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:04,346 INFO L231 Difference]: Finished difference. Result has 223 places, 216 transitions, 454 flow [2025-02-08 05:09:04,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=223, PETRI_TRANSITIONS=216} [2025-02-08 05:09:04,352 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -7 predicate places. [2025-02-08 05:09:04,355 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 216 transitions, 454 flow [2025-02-08 05:09:04,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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-02-08 05:09:04,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:04,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] [2025-02-08 05:09:04,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:09:04,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:04,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1071669629, now seen corresponding path program 1 times [2025-02-08 05:09:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:04,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614876645] [2025-02-08 05:09:04,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:04,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 05:09:04,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:09:04,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:04,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:04,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:04,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614876645] [2025-02-08 05:09:04,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614876645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:04,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:04,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:04,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589001674] [2025-02-08 05:09:04,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:04,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:04,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:04,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:04,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:04,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 242 [2025-02-08 05:09:04,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 216 transitions, 454 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-02-08 05:09:04,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:04,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 242 [2025-02-08 05:09:04,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:04,713 INFO L124 PetriNetUnfolderBase]: 60/1377 cut-off events. [2025-02-08 05:09:04,713 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-02-08 05:09:04,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 1377 events. 60/1377 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8669 event pairs, 28 based on Foata normal form. 0/1162 useless extension candidates. Maximal degree in co-relation 742. Up to 51 conditions per place. [2025-02-08 05:09:04,725 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 21 selfloop transitions, 1 changer transitions 0/225 dead transitions. [2025-02-08 05:09:04,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 225 transitions, 534 flow [2025-02-08 05:09:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-02-08 05:09:04,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118457300275482 [2025-02-08 05:09:04,729 INFO L175 Difference]: Start difference. First operand has 223 places, 216 transitions, 454 flow. Second operand 3 states and 662 transitions. [2025-02-08 05:09:04,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 225 transitions, 534 flow [2025-02-08 05:09:04,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 225 transitions, 533 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:04,735 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 453 flow [2025-02-08 05:09:04,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2025-02-08 05:09:04,739 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -13 predicate places. [2025-02-08 05:09:04,739 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 453 flow [2025-02-08 05:09:04,740 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-02-08 05:09:04,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:04,740 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] [2025-02-08 05:09:04,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:09:04,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:04,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:04,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1138113390, now seen corresponding path program 1 times [2025-02-08 05:09:04,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:04,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209128589] [2025-02-08 05:09:04,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:04,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:09:04,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:09:04,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:04,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:04,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209128589] [2025-02-08 05:09:04,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209128589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:04,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:04,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:04,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156654704] [2025-02-08 05:09:04,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:04,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:04,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:04,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:04,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:04,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 242 [2025-02-08 05:09:04,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-02-08 05:09:04,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:04,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 242 [2025-02-08 05:09:04,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:05,041 INFO L124 PetriNetUnfolderBase]: 232/1654 cut-off events. [2025-02-08 05:09:05,042 INFO L125 PetriNetUnfolderBase]: For 154/458 co-relation queries the response was YES. [2025-02-08 05:09:05,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 1654 events. 232/1654 cut-off events. For 154/458 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10741 event pairs, 52 based on Foata normal form. 19/1466 useless extension candidates. Maximal degree in co-relation 1088. Up to 355 conditions per place. [2025-02-08 05:09:05,051 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 15 selfloop transitions, 1 changer transitions 24/219 dead transitions. [2025-02-08 05:09:05,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 219 transitions, 527 flow [2025-02-08 05:09:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2025-02-08 05:09:05,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8677685950413223 [2025-02-08 05:09:05,054 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 453 flow. Second operand 3 states and 630 transitions. [2025-02-08 05:09:05,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 219 transitions, 527 flow [2025-02-08 05:09:05,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 219 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:05,058 INFO L231 Difference]: Finished difference. Result has 212 places, 191 transitions, 406 flow [2025-02-08 05:09:05,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=212, PETRI_TRANSITIONS=191} [2025-02-08 05:09:05,060 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -18 predicate places. [2025-02-08 05:09:05,060 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 191 transitions, 406 flow [2025-02-08 05:09:05,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-02-08 05:09:05,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:05,061 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] [2025-02-08 05:09:05,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:09:05,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:05,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash -773415250, now seen corresponding path program 1 times [2025-02-08 05:09:05,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:05,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548912253] [2025-02-08 05:09:05,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:05,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:05,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:09:05,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:09:05,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:05,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:05,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:05,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548912253] [2025-02-08 05:09:05,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548912253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:05,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:05,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:05,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588323392] [2025-02-08 05:09:05,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:05,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:05,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:05,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:05,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:05,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 242 [2025-02-08 05:09:05,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 191 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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-02-08 05:09:05,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:05,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 242 [2025-02-08 05:09:05,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:05,304 INFO L124 PetriNetUnfolderBase]: 184/1551 cut-off events. [2025-02-08 05:09:05,304 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-02-08 05:09:05,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 1551 events. 184/1551 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10295 event pairs, 156 based on Foata normal form. 0/1351 useless extension candidates. Maximal degree in co-relation 1839. Up to 362 conditions per place. [2025-02-08 05:09:05,314 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 18 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-02-08 05:09:05,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 188 transitions, 440 flow [2025-02-08 05:09:05,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2025-02-08 05:09:05,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.871900826446281 [2025-02-08 05:09:05,317 INFO L175 Difference]: Start difference. First operand has 212 places, 191 transitions, 406 flow. Second operand 3 states and 633 transitions. [2025-02-08 05:09:05,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 188 transitions, 440 flow [2025-02-08 05:09:05,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 188 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:05,328 INFO L231 Difference]: Finished difference. Result has 192 places, 188 transitions, 407 flow [2025-02-08 05:09:05,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=192, PETRI_TRANSITIONS=188} [2025-02-08 05:09:05,329 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -38 predicate places. [2025-02-08 05:09:05,329 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 188 transitions, 407 flow [2025-02-08 05:09:05,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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-02-08 05:09:05,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:05,330 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] [2025-02-08 05:09:05,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:09:05,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:05,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:05,331 INFO L85 PathProgramCache]: Analyzing trace with hash 268542788, now seen corresponding path program 1 times [2025-02-08 05:09:05,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:05,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692143837] [2025-02-08 05:09:05,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:05,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:05,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:09:05,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:09:05,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:05,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:05,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692143837] [2025-02-08 05:09:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692143837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:05,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145535705] [2025-02-08 05:09:05,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:05,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:05,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:05,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:05,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:05,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 242 [2025-02-08 05:09:05,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 188 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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-02-08 05:09:05,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:05,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 242 [2025-02-08 05:09:05,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:05,603 INFO L124 PetriNetUnfolderBase]: 124/1330 cut-off events. [2025-02-08 05:09:05,603 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-02-08 05:09:05,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1330 events. 124/1330 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8426 event pairs, 96 based on Foata normal form. 0/1141 useless extension candidates. Maximal degree in co-relation 840. Up to 250 conditions per place. [2025-02-08 05:09:05,611 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 17 selfloop transitions, 2 changer transitions 3/187 dead transitions. [2025-02-08 05:09:05,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 187 transitions, 445 flow [2025-02-08 05:09:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-02-08 05:09:05,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8760330578512396 [2025-02-08 05:09:05,614 INFO L175 Difference]: Start difference. First operand has 192 places, 188 transitions, 407 flow. Second operand 3 states and 636 transitions. [2025-02-08 05:09:05,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 187 transitions, 445 flow [2025-02-08 05:09:05,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 187 transitions, 445 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:05,620 INFO L231 Difference]: Finished difference. Result has 193 places, 184 transitions, 403 flow [2025-02-08 05:09:05,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=193, PETRI_TRANSITIONS=184} [2025-02-08 05:09:05,623 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -37 predicate places. [2025-02-08 05:09:05,625 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 184 transitions, 403 flow [2025-02-08 05:09:05,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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-02-08 05:09:05,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:05,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:05,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:09:05,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:05,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:05,628 INFO L85 PathProgramCache]: Analyzing trace with hash 217820038, now seen corresponding path program 1 times [2025-02-08 05:09:05,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:05,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746423245] [2025-02-08 05:09:05,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:05,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:05,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:09:05,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:09:05,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:05,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:05,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:05,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746423245] [2025-02-08 05:09:05,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746423245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:05,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:05,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:05,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694738735] [2025-02-08 05:09:05,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:05,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:05,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:05,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:05,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:05,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 242 [2025-02-08 05:09:05,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 184 transitions, 403 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-02-08 05:09:05,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:05,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 242 [2025-02-08 05:09:05,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:05,891 INFO L124 PetriNetUnfolderBase]: 60/1177 cut-off events. [2025-02-08 05:09:05,891 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-02-08 05:09:05,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 1177 events. 60/1177 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6864 event pairs, 28 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 684. Up to 51 conditions per place. [2025-02-08 05:09:05,897 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 21 selfloop transitions, 1 changer transitions 0/193 dead transitions. [2025-02-08 05:09:05,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 483 flow [2025-02-08 05:09:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-02-08 05:09:05,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118457300275482 [2025-02-08 05:09:05,900 INFO L175 Difference]: Start difference. First operand has 193 places, 184 transitions, 403 flow. Second operand 3 states and 662 transitions. [2025-02-08 05:09:05,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 483 flow [2025-02-08 05:09:05,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 193 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:05,905 INFO L231 Difference]: Finished difference. Result has 189 places, 183 transitions, 399 flow [2025-02-08 05:09:05,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=189, PETRI_TRANSITIONS=183} [2025-02-08 05:09:05,908 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -41 predicate places. [2025-02-08 05:09:05,908 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 183 transitions, 399 flow [2025-02-08 05:09:05,909 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-02-08 05:09:05,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:05,909 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] [2025-02-08 05:09:05,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:09:05,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:05,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1630578327, now seen corresponding path program 1 times [2025-02-08 05:09:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:05,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764307169] [2025-02-08 05:09:05,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:05,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:09:05,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:09:05,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:05,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:05,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764307169] [2025-02-08 05:09:05,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764307169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:05,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:05,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:05,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195289259] [2025-02-08 05:09:05,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:05,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:05,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:05,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:05,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:05,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 242 [2025-02-08 05:09:05,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 183 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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-02-08 05:09:05,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:05,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 242 [2025-02-08 05:09:05,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:06,138 INFO L124 PetriNetUnfolderBase]: 120/1268 cut-off events. [2025-02-08 05:09:06,139 INFO L125 PetriNetUnfolderBase]: For 118/222 co-relation queries the response was YES. [2025-02-08 05:09:06,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1268 events. 120/1268 cut-off events. For 118/222 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7936 event pairs, 92 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 808. Up to 234 conditions per place. [2025-02-08 05:09:06,146 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 18 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-02-08 05:09:06,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 182 transitions, 437 flow [2025-02-08 05:09:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-02-08 05:09:06,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746556473829201 [2025-02-08 05:09:06,149 INFO L175 Difference]: Start difference. First operand has 189 places, 183 transitions, 399 flow. Second operand 3 states and 635 transitions. [2025-02-08 05:09:06,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 182 transitions, 437 flow [2025-02-08 05:09:06,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 182 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:06,153 INFO L231 Difference]: Finished difference. Result has 189 places, 182 transitions, 400 flow [2025-02-08 05:09:06,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=189, PETRI_TRANSITIONS=182} [2025-02-08 05:09:06,154 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -41 predicate places. [2025-02-08 05:09:06,155 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 182 transitions, 400 flow [2025-02-08 05:09:06,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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-02-08 05:09:06,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:06,155 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] [2025-02-08 05:09:06,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:09:06,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:06,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1354774386, now seen corresponding path program 1 times [2025-02-08 05:09:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131223732] [2025-02-08 05:09:06,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:06,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:09:06,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:09:06,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:06,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:06,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:06,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131223732] [2025-02-08 05:09:06,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131223732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:06,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:06,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:09:06,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217849780] [2025-02-08 05:09:06,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:06,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:06,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:06,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:06,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:06,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 242 [2025-02-08 05:09:06,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 182 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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-02-08 05:09:06,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:06,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 242 [2025-02-08 05:09:06,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:06,349 INFO L124 PetriNetUnfolderBase]: 58/1164 cut-off events. [2025-02-08 05:09:06,349 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-02-08 05:09:06,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 1164 events. 58/1164 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6780 event pairs, 28 based on Foata normal form. 2/1023 useless extension candidates. Maximal degree in co-relation 695. Up to 110 conditions per place. [2025-02-08 05:09:06,356 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 16 selfloop transitions, 0 changer transitions 1/181 dead transitions. [2025-02-08 05:09:06,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 181 transitions, 429 flow [2025-02-08 05:09:06,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-02-08 05:09:06,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8760330578512396 [2025-02-08 05:09:06,358 INFO L175 Difference]: Start difference. First operand has 189 places, 182 transitions, 400 flow. Second operand 3 states and 636 transitions. [2025-02-08 05:09:06,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 181 transitions, 429 flow [2025-02-08 05:09:06,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 181 transitions, 421 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 05:09:06,364 INFO L231 Difference]: Finished difference. Result has 188 places, 180 transitions, 387 flow [2025-02-08 05:09:06,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=188, PETRI_TRANSITIONS=180} [2025-02-08 05:09:06,366 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -42 predicate places. [2025-02-08 05:09:06,366 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 180 transitions, 387 flow [2025-02-08 05:09:06,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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-02-08 05:09:06,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:06,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:06,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:09:06,368 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:06,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2097111441, now seen corresponding path program 1 times [2025-02-08 05:09:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600644663] [2025-02-08 05:09:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:06,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:09:06,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:09:06,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:06,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:06,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:06,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600644663] [2025-02-08 05:09:06,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600644663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:06,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:06,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:09:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842587456] [2025-02-08 05:09:06,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:06,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:09:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:06,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:09:06,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:09:07,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 242 [2025-02-08 05:09:07,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 180 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 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-02-08 05:09:07,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:07,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 242 [2025-02-08 05:09:07,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:07,465 INFO L124 PetriNetUnfolderBase]: 652/3388 cut-off events. [2025-02-08 05:09:07,465 INFO L125 PetriNetUnfolderBase]: For 96/106 co-relation queries the response was YES. [2025-02-08 05:09:07,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4910 conditions, 3388 events. 652/3388 cut-off events. For 96/106 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 28227 event pairs, 296 based on Foata normal form. 0/3003 useless extension candidates. Maximal degree in co-relation 4904. Up to 1255 conditions per place. [2025-02-08 05:09:07,485 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 44 selfloop transitions, 5 changer transitions 4/187 dead transitions. [2025-02-08 05:09:07,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 501 flow [2025-02-08 05:09:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:09:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:09:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1137 transitions. [2025-02-08 05:09:07,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7830578512396694 [2025-02-08 05:09:07,488 INFO L175 Difference]: Start difference. First operand has 188 places, 180 transitions, 387 flow. Second operand 6 states and 1137 transitions. [2025-02-08 05:09:07,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 501 flow [2025-02-08 05:09:07,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 187 transitions, 499 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:07,492 INFO L231 Difference]: Finished difference. Result has 190 places, 175 transitions, 385 flow [2025-02-08 05:09:07,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=190, PETRI_TRANSITIONS=175} [2025-02-08 05:09:07,493 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -40 predicate places. [2025-02-08 05:09:07,493 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 175 transitions, 385 flow [2025-02-08 05:09:07,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 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-02-08 05:09:07,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:07,494 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] [2025-02-08 05:09:07,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:09:07,494 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:07,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1581034050, now seen corresponding path program 1 times [2025-02-08 05:09:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:07,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233498619] [2025-02-08 05:09:07,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:07,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:07,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:09:07,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:09:07,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:07,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:07,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-02-08 05:09:07,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:07,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233498619] [2025-02-08 05:09:07,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233498619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:07,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:07,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:09:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950509136] [2025-02-08 05:09:07,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:07,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:09:07,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:07,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:09:07,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:09:07,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 242 [2025-02-08 05:09:07,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 175 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 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-02-08 05:09:07,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:07,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 242 [2025-02-08 05:09:07,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:07,901 INFO L124 PetriNetUnfolderBase]: 159/1449 cut-off events. [2025-02-08 05:09:07,902 INFO L125 PetriNetUnfolderBase]: For 90/192 co-relation queries the response was YES. [2025-02-08 05:09:07,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 1449 events. 159/1449 cut-off events. For 90/192 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9748 event pairs, 120 based on Foata normal form. 11/1288 useless extension candidates. Maximal degree in co-relation 1900. Up to 209 conditions per place. [2025-02-08 05:09:07,910 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 42 selfloop transitions, 10 changer transitions 0/203 dead transitions. [2025-02-08 05:09:07,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 203 transitions, 569 flow [2025-02-08 05:09:07,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:09:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:09:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 858 transitions. [2025-02-08 05:09:07,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2025-02-08 05:09:07,913 INFO L175 Difference]: Start difference. First operand has 190 places, 175 transitions, 385 flow. Second operand 4 states and 858 transitions. [2025-02-08 05:09:07,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 203 transitions, 569 flow [2025-02-08 05:09:07,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 203 transitions, 559 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:09:07,917 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 449 flow [2025-02-08 05:09:07,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-02-08 05:09:07,918 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -44 predicate places. [2025-02-08 05:09:07,918 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 449 flow [2025-02-08 05:09:07,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 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-02-08 05:09:07,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:07,919 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, 1] [2025-02-08 05:09:07,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:09:07,919 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:09:07,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1843956427, now seen corresponding path program 1 times [2025-02-08 05:09:07,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:07,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344984572] [2025-02-08 05:09:07,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:07,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:09:07,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:09:07,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:07,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:09:07,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:09:07,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:09:07,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:09:07,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:07,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:09:08,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:09:08,011 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:09:08,012 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-02-08 05:09:08,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-02-08 05:09:08,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-02-08 05:09:08,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-02-08 05:09:08,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-02-08 05:09:08,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-02-08 05:09:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-02-08 05:09:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 33 remaining) [2025-02-08 05:09:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-02-08 05:09:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-02-08 05:09:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-02-08 05:09:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-02-08 05:09:08,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-02-08 05:09:08,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:09:08,018 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:08,020 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:09:08,020 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:09:08,068 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-02-08 05:09:08,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 271 transitions, 586 flow [2025-02-08 05:09:08,209 INFO L124 PetriNetUnfolderBase]: 149/1607 cut-off events. [2025-02-08 05:09:08,209 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-08 05:09:08,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 1607 events. 149/1607 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 9251 event pairs, 2 based on Foata normal form. 0/1314 useless extension candidates. Maximal degree in co-relation 931. Up to 32 conditions per place. [2025-02-08 05:09:08,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 271 transitions, 586 flow [2025-02-08 05:09:08,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 271 transitions, 586 flow [2025-02-08 05:09:08,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:08,233 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;@c750384, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:08,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-08 05:09:08,234 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:08,235 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 05:09:08,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:09:08,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:08,235 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-02-08 05:09:08,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:08,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:08,236 INFO L85 PathProgramCache]: Analyzing trace with hash -300789637, now seen corresponding path program 1 times [2025-02-08 05:09:08,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:08,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264416008] [2025-02-08 05:09:08,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:08,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:09:08,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:09:08,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:08,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:08,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:08,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264416008] [2025-02-08 05:09:08,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264416008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:08,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:08,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:08,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933461519] [2025-02-08 05:09:08,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:08,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:08,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:08,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:08,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 271 [2025-02-08 05:09:08,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 271 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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-02-08 05:09:08,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:08,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 271 [2025-02-08 05:09:08,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:09,369 INFO L124 PetriNetUnfolderBase]: 2218/9953 cut-off events. [2025-02-08 05:09:09,369 INFO L125 PetriNetUnfolderBase]: For 2581/5650 co-relation queries the response was YES. [2025-02-08 05:09:09,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13940 conditions, 9953 events. 2218/9953 cut-off events. For 2581/5650 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 103754 event pairs, 1905 based on Foata normal form. 879/9106 useless extension candidates. Maximal degree in co-relation 9049. Up to 3249 conditions per place. [2025-02-08 05:09:09,463 INFO L140 encePairwiseOnDemand]: 246/271 looper letters, 28 selfloop transitions, 1 changer transitions 4/245 dead transitions. [2025-02-08 05:09:09,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 245 transitions, 592 flow [2025-02-08 05:09:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-02-08 05:09:09,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8622386223862238 [2025-02-08 05:09:09,466 INFO L175 Difference]: Start difference. First operand has 258 places, 271 transitions, 586 flow. Second operand 3 states and 701 transitions. [2025-02-08 05:09:09,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 245 transitions, 592 flow [2025-02-08 05:09:09,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:09,472 INFO L231 Difference]: Finished difference. Result has 246 places, 241 transitions, 528 flow [2025-02-08 05:09:09,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=246, PETRI_TRANSITIONS=241} [2025-02-08 05:09:09,473 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -12 predicate places. [2025-02-08 05:09:09,473 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 241 transitions, 528 flow [2025-02-08 05:09:09,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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-02-08 05:09:09,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:09,474 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-02-08 05:09:09,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:09:09,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:09,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:09,475 INFO L85 PathProgramCache]: Analyzing trace with hash -734716080, now seen corresponding path program 1 times [2025-02-08 05:09:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565695639] [2025-02-08 05:09:09,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:09,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:09,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 05:09:09,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:09:09,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:09,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:09,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:09,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565695639] [2025-02-08 05:09:09,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565695639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:09,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:09,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707865510] [2025-02-08 05:09:09,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:09,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:09,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:09,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:09,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 271 [2025-02-08 05:09:09,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 241 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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-02-08 05:09:09,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:09,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 271 [2025-02-08 05:09:09,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:11,325 INFO L124 PetriNetUnfolderBase]: 2492/17389 cut-off events. [2025-02-08 05:09:11,325 INFO L125 PetriNetUnfolderBase]: For 4748/26624 co-relation queries the response was YES. [2025-02-08 05:09:11,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22356 conditions, 17389 events. 2492/17389 cut-off events. For 4748/26624 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 215995 event pairs, 1706 based on Foata normal form. 0/14144 useless extension candidates. Maximal degree in co-relation 11147. Up to 1670 conditions per place. [2025-02-08 05:09:11,512 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 41 selfloop transitions, 1 changer transitions 0/260 dead transitions. [2025-02-08 05:09:11,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 260 transitions, 690 flow [2025-02-08 05:09:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2025-02-08 05:09:11,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868388683886839 [2025-02-08 05:09:11,515 INFO L175 Difference]: Start difference. First operand has 246 places, 241 transitions, 528 flow. Second operand 3 states and 721 transitions. [2025-02-08 05:09:11,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 260 transitions, 690 flow [2025-02-08 05:09:11,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 260 transitions, 689 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:11,521 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 527 flow [2025-02-08 05:09:11,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2025-02-08 05:09:11,522 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -16 predicate places. [2025-02-08 05:09:11,522 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 527 flow [2025-02-08 05:09:11,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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-02-08 05:09:11,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:11,523 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] [2025-02-08 05:09:11,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:09:11,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:11,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1301228210, now seen corresponding path program 1 times [2025-02-08 05:09:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:11,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767337811] [2025-02-08 05:09:11,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:11,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:11,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:09:11,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:09:11,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:11,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:11,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767337811] [2025-02-08 05:09:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767337811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:11,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:11,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:11,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044009503] [2025-02-08 05:09:11,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:11,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:11,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:11,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:11,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 271 [2025-02-08 05:09:11,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-02-08 05:09:11,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:11,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 271 [2025-02-08 05:09:11,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:15,101 INFO L124 PetriNetUnfolderBase]: 14770/40622 cut-off events. [2025-02-08 05:09:15,101 INFO L125 PetriNetUnfolderBase]: For 8274/46430 co-relation queries the response was YES. [2025-02-08 05:09:15,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64561 conditions, 40622 events. 14770/40622 cut-off events. For 8274/46430 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 463629 event pairs, 4272 based on Foata normal form. 121/35650 useless extension candidates. Maximal degree in co-relation 32276. Up to 17809 conditions per place. [2025-02-08 05:09:15,306 INFO L140 encePairwiseOnDemand]: 257/271 looper letters, 41 selfloop transitions, 2 changer transitions 18/255 dead transitions. [2025-02-08 05:09:15,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 255 transitions, 696 flow [2025-02-08 05:09:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-02-08 05:09:15,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437884378843789 [2025-02-08 05:09:15,308 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 527 flow. Second operand 3 states and 686 transitions. [2025-02-08 05:09:15,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 255 transitions, 696 flow [2025-02-08 05:09:15,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 255 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:15,316 INFO L231 Difference]: Finished difference. Result has 237 places, 220 transitions, 496 flow [2025-02-08 05:09:15,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=237, PETRI_TRANSITIONS=220} [2025-02-08 05:09:15,317 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -21 predicate places. [2025-02-08 05:09:15,317 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 220 transitions, 496 flow [2025-02-08 05:09:15,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-02-08 05:09:15,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:15,318 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] [2025-02-08 05:09:15,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:09:15,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:15,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash 71459374, now seen corresponding path program 1 times [2025-02-08 05:09:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:15,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869678706] [2025-02-08 05:09:15,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:15,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:15,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:09:15,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:09:15,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:15,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:15,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869678706] [2025-02-08 05:09:15,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869678706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:15,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:15,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:15,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086124347] [2025-02-08 05:09:15,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:15,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:15,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:15,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:15,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 271 [2025-02-08 05:09:15,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 220 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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-02-08 05:09:15,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:15,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 271 [2025-02-08 05:09:15,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:17,483 INFO L124 PetriNetUnfolderBase]: 6096/21809 cut-off events. [2025-02-08 05:09:17,483 INFO L125 PetriNetUnfolderBase]: For 4256/10796 co-relation queries the response was YES. [2025-02-08 05:09:17,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33778 conditions, 21809 events. 6096/21809 cut-off events. For 4256/10796 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 243999 event pairs, 5210 based on Foata normal form. 0/19055 useless extension candidates. Maximal degree in co-relation 28671. Up to 8524 conditions per place. [2025-02-08 05:09:17,591 INFO L140 encePairwiseOnDemand]: 265/271 looper letters, 28 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2025-02-08 05:09:17,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 217 transitions, 550 flow [2025-02-08 05:09:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-02-08 05:09:17,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388683886838868 [2025-02-08 05:09:17,593 INFO L175 Difference]: Start difference. First operand has 237 places, 220 transitions, 496 flow. Second operand 3 states and 682 transitions. [2025-02-08 05:09:17,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 217 transitions, 550 flow [2025-02-08 05:09:17,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 217 transitions, 550 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:17,599 INFO L231 Difference]: Finished difference. Result has 221 places, 217 transitions, 498 flow [2025-02-08 05:09:17,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=221, PETRI_TRANSITIONS=217} [2025-02-08 05:09:17,600 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -37 predicate places. [2025-02-08 05:09:17,600 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 217 transitions, 498 flow [2025-02-08 05:09:17,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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-02-08 05:09:17,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:17,601 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] [2025-02-08 05:09:17,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:09:17,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:17,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash 444246116, now seen corresponding path program 1 times [2025-02-08 05:09:17,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:17,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383202738] [2025-02-08 05:09:17,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:17,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:17,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:09:17,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:09:17,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:17,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:17,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383202738] [2025-02-08 05:09:17,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383202738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:17,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:17,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:17,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091603941] [2025-02-08 05:09:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:17,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:17,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:17,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:17,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 271 [2025-02-08 05:09:17,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 217 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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-02-08 05:09:17,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:17,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 271 [2025-02-08 05:09:17,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:19,184 INFO L124 PetriNetUnfolderBase]: 4656/18252 cut-off events. [2025-02-08 05:09:19,184 INFO L125 PetriNetUnfolderBase]: For 4254/12402 co-relation queries the response was YES. [2025-02-08 05:09:19,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27758 conditions, 18252 events. 4656/18252 cut-off events. For 4254/12402 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 205556 event pairs, 3782 based on Foata normal form. 0/15259 useless extension candidates. Maximal degree in co-relation 24022. Up to 6578 conditions per place. [2025-02-08 05:09:19,263 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 28 selfloop transitions, 2 changer transitions 2/216 dead transitions. [2025-02-08 05:09:19,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 216 transitions, 556 flow [2025-02-08 05:09:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2025-02-08 05:09:19,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425584255842559 [2025-02-08 05:09:19,266 INFO L175 Difference]: Start difference. First operand has 221 places, 217 transitions, 498 flow. Second operand 3 states and 685 transitions. [2025-02-08 05:09:19,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 216 transitions, 556 flow [2025-02-08 05:09:19,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 216 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:09:19,271 INFO L231 Difference]: Finished difference. Result has 222 places, 214 transitions, 496 flow [2025-02-08 05:09:19,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=222, PETRI_TRANSITIONS=214} [2025-02-08 05:09:19,272 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -36 predicate places. [2025-02-08 05:09:19,272 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 214 transitions, 496 flow [2025-02-08 05:09:19,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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-02-08 05:09:19,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:19,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:19,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:09:19,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:19,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1896282746, now seen corresponding path program 1 times [2025-02-08 05:09:19,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:19,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223075815] [2025-02-08 05:09:19,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:19,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:09:19,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:09:19,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:19,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:19,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:19,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223075815] [2025-02-08 05:09:19,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223075815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:19,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:19,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929508337] [2025-02-08 05:09:19,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:19,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:19,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:19,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:19,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 271 [2025-02-08 05:09:19,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 214 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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-02-08 05:09:19,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:19,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 271 [2025-02-08 05:09:19,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:20,860 INFO L124 PetriNetUnfolderBase]: 2546/15313 cut-off events. [2025-02-08 05:09:20,860 INFO L125 PetriNetUnfolderBase]: For 4748/26624 co-relation queries the response was YES. [2025-02-08 05:09:20,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20987 conditions, 15313 events. 2546/15313 cut-off events. For 4748/26624 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 181172 event pairs, 1706 based on Foata normal form. 0/12925 useless extension candidates. Maximal degree in co-relation 19194. Up to 1670 conditions per place. [2025-02-08 05:09:20,967 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 41 selfloop transitions, 1 changer transitions 0/233 dead transitions. [2025-02-08 05:09:20,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 233 transitions, 658 flow [2025-02-08 05:09:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2025-02-08 05:09:20,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868388683886839 [2025-02-08 05:09:20,969 INFO L175 Difference]: Start difference. First operand has 222 places, 214 transitions, 496 flow. Second operand 3 states and 721 transitions. [2025-02-08 05:09:20,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 233 transitions, 658 flow [2025-02-08 05:09:20,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 233 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:20,976 INFO L231 Difference]: Finished difference. Result has 219 places, 213 transitions, 492 flow [2025-02-08 05:09:20,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=219, PETRI_TRANSITIONS=213} [2025-02-08 05:09:20,977 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -39 predicate places. [2025-02-08 05:09:20,977 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 213 transitions, 492 flow [2025-02-08 05:09:20,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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-02-08 05:09:20,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:20,978 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] [2025-02-08 05:09:20,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:09:20,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:20,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:20,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1986481462, now seen corresponding path program 1 times [2025-02-08 05:09:20,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:20,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537988676] [2025-02-08 05:09:20,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:20,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:20,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:09:20,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:09:20,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:20,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:21,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537988676] [2025-02-08 05:09:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537988676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:21,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:21,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854100630] [2025-02-08 05:09:21,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:21,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:21,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:21,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:21,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:21,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 271 [2025-02-08 05:09:21,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 213 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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-02-08 05:09:21,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:21,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 271 [2025-02-08 05:09:21,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:22,680 INFO L124 PetriNetUnfolderBase]: 5342/19618 cut-off events. [2025-02-08 05:09:22,680 INFO L125 PetriNetUnfolderBase]: For 4260/12460 co-relation queries the response was YES. [2025-02-08 05:09:22,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30270 conditions, 19618 events. 5342/19618 cut-off events. For 4260/12460 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 222624 event pairs, 4482 based on Foata normal form. 0/16493 useless extension candidates. Maximal degree in co-relation 25847. Up to 7458 conditions per place. [2025-02-08 05:09:22,800 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 29 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-02-08 05:09:22,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 212 transitions, 552 flow [2025-02-08 05:09:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2025-02-08 05:09:22,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425584255842559 [2025-02-08 05:09:22,802 INFO L175 Difference]: Start difference. First operand has 219 places, 213 transitions, 492 flow. Second operand 3 states and 685 transitions. [2025-02-08 05:09:22,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 212 transitions, 552 flow [2025-02-08 05:09:22,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 212 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:22,808 INFO L231 Difference]: Finished difference. Result has 219 places, 212 transitions, 493 flow [2025-02-08 05:09:22,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=219, PETRI_TRANSITIONS=212} [2025-02-08 05:09:22,808 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -39 predicate places. [2025-02-08 05:09:22,808 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 212 transitions, 493 flow [2025-02-08 05:09:22,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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-02-08 05:09:22,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:22,809 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] [2025-02-08 05:09:22,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:09:22,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:22,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:22,809 INFO L85 PathProgramCache]: Analyzing trace with hash -91776133, now seen corresponding path program 1 times [2025-02-08 05:09:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:22,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231074952] [2025-02-08 05:09:22,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:22,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:22,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:09:22,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:09:22,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:22,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:22,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:22,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231074952] [2025-02-08 05:09:22,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231074952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:22,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:22,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:09:22,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899688892] [2025-02-08 05:09:22,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:22,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:22,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:22,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:22,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:22,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 271 [2025-02-08 05:09:22,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 212 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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-02-08 05:09:22,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:22,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 271 [2025-02-08 05:09:22,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:24,614 INFO L124 PetriNetUnfolderBase]: 3752/18416 cut-off events. [2025-02-08 05:09:24,614 INFO L125 PetriNetUnfolderBase]: For 4748/26624 co-relation queries the response was YES. [2025-02-08 05:09:24,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26174 conditions, 18416 events. 3752/18416 cut-off events. For 4748/26624 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 217841 event pairs, 2730 based on Foata normal form. 2/15381 useless extension candidates. Maximal degree in co-relation 23379. Up to 5036 conditions per place. [2025-02-08 05:09:24,695 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 27 selfloop transitions, 0 changer transitions 1/211 dead transitions. [2025-02-08 05:09:24,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 211 transitions, 544 flow [2025-02-08 05:09:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-02-08 05:09:24,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437884378843789 [2025-02-08 05:09:24,697 INFO L175 Difference]: Start difference. First operand has 219 places, 212 transitions, 493 flow. Second operand 3 states and 686 transitions. [2025-02-08 05:09:24,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 211 transitions, 544 flow [2025-02-08 05:09:24,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 536 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 05:09:24,702 INFO L231 Difference]: Finished difference. Result has 218 places, 210 transitions, 480 flow [2025-02-08 05:09:24,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=218, PETRI_TRANSITIONS=210} [2025-02-08 05:09:24,703 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -40 predicate places. [2025-02-08 05:09:24,703 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 210 transitions, 480 flow [2025-02-08 05:09:24,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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-02-08 05:09:24,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:24,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:24,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:09:24,704 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:24,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -130146575, now seen corresponding path program 1 times [2025-02-08 05:09:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:24,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640616668] [2025-02-08 05:09:24,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:24,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:09:24,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:09:24,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:24,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:25,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:25,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640616668] [2025-02-08 05:09:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640616668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:25,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:25,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:09:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011449337] [2025-02-08 05:09:25,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:25,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:09:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:25,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:09:25,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:09:25,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 271 [2025-02-08 05:09:25,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 210 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 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-02-08 05:09:25,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:25,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 271 [2025-02-08 05:09:25,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:30,980 INFO L124 PetriNetUnfolderBase]: 21016/65744 cut-off events. [2025-02-08 05:09:30,981 INFO L125 PetriNetUnfolderBase]: For 3106/3248 co-relation queries the response was YES. [2025-02-08 05:09:31,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104271 conditions, 65744 events. 21016/65744 cut-off events. For 3106/3248 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 823264 event pairs, 9754 based on Foata normal form. 0/59499 useless extension candidates. Maximal degree in co-relation 104262. Up to 29941 conditions per place. [2025-02-08 05:09:31,397 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 64 selfloop transitions, 5 changer transitions 3/225 dead transitions. [2025-02-08 05:09:31,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 225 transitions, 650 flow [2025-02-08 05:09:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:09:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:09:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1235 transitions. [2025-02-08 05:09:31,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7595325953259533 [2025-02-08 05:09:31,400 INFO L175 Difference]: Start difference. First operand has 218 places, 210 transitions, 480 flow. Second operand 6 states and 1235 transitions. [2025-02-08 05:09:31,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 225 transitions, 650 flow [2025-02-08 05:09:31,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 225 transitions, 648 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:31,408 INFO L231 Difference]: Finished difference. Result has 220 places, 206 transitions, 480 flow [2025-02-08 05:09:31,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=220, PETRI_TRANSITIONS=206} [2025-02-08 05:09:31,409 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -38 predicate places. [2025-02-08 05:09:31,409 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 206 transitions, 480 flow [2025-02-08 05:09:31,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 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-02-08 05:09:31,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:31,410 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] [2025-02-08 05:09:31,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:09:31,410 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:31,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2006717154, now seen corresponding path program 1 times [2025-02-08 05:09:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:31,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103578874] [2025-02-08 05:09:31,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:31,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:31,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:09:31,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:09:31,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:31,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:31,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103578874] [2025-02-08 05:09:31,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103578874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:31,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:31,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:09:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563686907] [2025-02-08 05:09:31,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:31,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:09:31,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:31,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:09:31,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:09:31,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 271 [2025-02-08 05:09:31,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 206 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 215.5) internal successors, (862), 4 states have internal predecessors, (862), 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-02-08 05:09:31,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:31,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 271 [2025-02-08 05:09:31,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:34,266 INFO L124 PetriNetUnfolderBase]: 7222/26805 cut-off events. [2025-02-08 05:09:34,266 INFO L125 PetriNetUnfolderBase]: For 3680/8506 co-relation queries the response was YES. [2025-02-08 05:09:34,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40888 conditions, 26805 events. 7222/26805 cut-off events. For 3680/8506 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 316038 event pairs, 5043 based on Foata normal form. 137/23508 useless extension candidates. Maximal degree in co-relation 40879. Up to 5892 conditions per place. [2025-02-08 05:09:34,396 INFO L140 encePairwiseOnDemand]: 258/271 looper letters, 77 selfloop transitions, 11 changer transitions 0/259 dead transitions. [2025-02-08 05:09:34,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 259 transitions, 826 flow [2025-02-08 05:09:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:09:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:09:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 946 transitions. [2025-02-08 05:09:34,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8726937269372693 [2025-02-08 05:09:34,398 INFO L175 Difference]: Start difference. First operand has 220 places, 206 transitions, 480 flow. Second operand 4 states and 946 transitions. [2025-02-08 05:09:34,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 259 transitions, 826 flow [2025-02-08 05:09:34,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 259 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:09:34,405 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 552 flow [2025-02-08 05:09:34,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=552, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2025-02-08 05:09:34,406 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -41 predicate places. [2025-02-08 05:09:34,406 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 552 flow [2025-02-08 05:09:34,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.5) internal successors, (862), 4 states have internal predecessors, (862), 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-02-08 05:09:34,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:34,407 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, 1] [2025-02-08 05:09:34,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:09:34,407 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:34,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1731877248, now seen corresponding path program 1 times [2025-02-08 05:09:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:34,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115684326] [2025-02-08 05:09:34,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:34,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:09:34,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:09:34,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:34,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:34,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:34,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115684326] [2025-02-08 05:09:34,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115684326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:34,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:34,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:09:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461487329] [2025-02-08 05:09:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:34,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:09:34,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:34,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:09:34,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:09:34,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 271 [2025-02-08 05:09:34,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 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-02-08 05:09:34,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:34,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 271 [2025-02-08 05:09:34,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:37,280 INFO L124 PetriNetUnfolderBase]: 7028/27245 cut-off events. [2025-02-08 05:09:37,281 INFO L125 PetriNetUnfolderBase]: For 7164/10057 co-relation queries the response was YES. [2025-02-08 05:09:37,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44175 conditions, 27245 events. 7028/27245 cut-off events. For 7164/10057 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 324189 event pairs, 4588 based on Foata normal form. 3/23823 useless extension candidates. Maximal degree in co-relation 44164. Up to 5944 conditions per place. [2025-02-08 05:09:37,490 INFO L140 encePairwiseOnDemand]: 257/271 looper letters, 88 selfloop transitions, 14 changer transitions 0/271 dead transitions. [2025-02-08 05:09:37,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 271 transitions, 948 flow [2025-02-08 05:09:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:09:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 05:09:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1587 transitions. [2025-02-08 05:09:37,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8365840801265155 [2025-02-08 05:09:37,493 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 552 flow. Second operand 7 states and 1587 transitions. [2025-02-08 05:09:37,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 271 transitions, 948 flow [2025-02-08 05:09:37,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 271 transitions, 946 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:09:37,503 INFO L231 Difference]: Finished difference. Result has 225 places, 218 transitions, 607 flow [2025-02-08 05:09:37,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=607, PETRI_PLACES=225, PETRI_TRANSITIONS=218} [2025-02-08 05:09:37,503 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -33 predicate places. [2025-02-08 05:09:37,503 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 218 transitions, 607 flow [2025-02-08 05:09:37,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 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-02-08 05:09:37,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:37,504 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-02-08 05:09:37,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:09:37,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:37,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:37,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1791053505, now seen corresponding path program 1 times [2025-02-08 05:09:37,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:37,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802966723] [2025-02-08 05:09:37,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:37,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:37,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:09:37,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:09:37,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:37,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:38,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802966723] [2025-02-08 05:09:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802966723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:38,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:38,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:09:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782487836] [2025-02-08 05:09:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:38,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:09:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:38,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:09:38,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:09:38,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 271 [2025-02-08 05:09:38,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 218 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 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-02-08 05:09:38,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:38,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 271 [2025-02-08 05:09:38,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:42,780 INFO L124 PetriNetUnfolderBase]: 21085/50115 cut-off events. [2025-02-08 05:09:42,780 INFO L125 PetriNetUnfolderBase]: For 8511/8515 co-relation queries the response was YES. [2025-02-08 05:09:42,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87702 conditions, 50115 events. 21085/50115 cut-off events. For 8511/8515 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 518597 event pairs, 9342 based on Foata normal form. 0/47064 useless extension candidates. Maximal degree in co-relation 87688. Up to 25899 conditions per place. [2025-02-08 05:09:43,103 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 90 selfloop transitions, 6 changer transitions 0/249 dead transitions. [2025-02-08 05:09:43,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 249 transitions, 861 flow [2025-02-08 05:09:43,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:09:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:09:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1251 transitions. [2025-02-08 05:09:43,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7693726937269373 [2025-02-08 05:09:43,106 INFO L175 Difference]: Start difference. First operand has 225 places, 218 transitions, 607 flow. Second operand 6 states and 1251 transitions. [2025-02-08 05:09:43,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 249 transitions, 861 flow [2025-02-08 05:09:43,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 249 transitions, 837 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 05:09:43,123 INFO L231 Difference]: Finished difference. Result has 226 places, 217 transitions, 593 flow [2025-02-08 05:09:43,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=226, PETRI_TRANSITIONS=217} [2025-02-08 05:09:43,124 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -32 predicate places. [2025-02-08 05:09:43,124 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 593 flow [2025-02-08 05:09:43,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 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-02-08 05:09:43,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:43,124 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, 1] [2025-02-08 05:09:43,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:09:43,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:09:43,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1275178679, now seen corresponding path program 1 times [2025-02-08 05:09:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:43,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215650896] [2025-02-08 05:09:43,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:43,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:43,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:09:43,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:09:43,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:43,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:43,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215650896] [2025-02-08 05:09:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215650896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:43,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:43,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:09:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288770926] [2025-02-08 05:09:43,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:43,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:09:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:43,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:09:43,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:09:43,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 271 [2025-02-08 05:09:43,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 213.8) internal successors, (1069), 5 states have internal predecessors, (1069), 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-02-08 05:09:43,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:43,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 271 [2025-02-08 05:09:43,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand