./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c -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 f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:16,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:16,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:16,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:16,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:16,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:16,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:16,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:16,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:16,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:16,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:16,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:16,652 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:16,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:16,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:16,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:16,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:16,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:16,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:16,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:16,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:16,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:16,653 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:16,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:16,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:16,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:16,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:16,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:16,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:16,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:16,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:16,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:16,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:16,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:16,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:16,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:16,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:16,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:16,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:16,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:16,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:16,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:16,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:16,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:16,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:16,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:16,655 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 -> f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 [2025-01-09 21:30:16,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:16,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:16,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:16,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:16,941 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:16,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-01-09 21:30:18,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98675e921/b234f99bdbb04fe794e3c271af2d6f9e/FLAG5956b607d [2025-01-09 21:30:18,536 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:18,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-01-09 21:30:18,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98675e921/b234f99bdbb04fe794e3c271af2d6f9e/FLAG5956b607d [2025-01-09 21:30:18,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98675e921/b234f99bdbb04fe794e3c271af2d6f9e [2025-01-09 21:30:18,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:18,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:18,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:18,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:18,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:18,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:18,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f6f35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18, skipping insertion in model container [2025-01-09 21:30:18,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:18,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:18,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:18,829 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:18,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:18,896 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:18,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18 WrapperNode [2025-01-09 21:30:18,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:18,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:18,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:18,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:18,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:18,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:18,953 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 424 [2025-01-09 21:30:18,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:18,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:18,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:18,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:18,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:18,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:18,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:18,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:18,984 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:18,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:19,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:19,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:19,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:19,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:19,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:19,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:19,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:19,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (1/1) ... [2025-01-09 21:30:19,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:19,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:19,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:30:19,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:30:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:19,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:19,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:30:19,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:30:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:30:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:30:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:30:19,091 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:19,215 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:19,217 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:19,869 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:19,870 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:19,898 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:19,898 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:19,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:19 BoogieIcfgContainer [2025-01-09 21:30:19,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:19,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:19,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:19,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:19,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:18" (1/3) ... [2025-01-09 21:30:19,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4831d536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:19, skipping insertion in model container [2025-01-09 21:30:19,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:18" (2/3) ... [2025-01-09 21:30:19,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4831d536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:19, skipping insertion in model container [2025-01-09 21:30:19,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:19" (3/3) ... [2025-01-09 21:30:19,910 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2025-01-09 21:30:19,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:19,926 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-trans.wvr.c that has 4 procedures, 548 locations, 1 initial locations, 6 loop locations, and 45 error locations. [2025-01-09 21:30:19,926 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:20,091 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:30:20,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 557 places, 574 transitions, 1169 flow [2025-01-09 21:30:20,365 INFO L124 PetriNetUnfolderBase]: 27/571 cut-off events. [2025-01-09 21:30:20,369 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:20,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 571 events. 27/571 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1251 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 431. Up to 2 conditions per place. [2025-01-09 21:30:20,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 557 places, 574 transitions, 1169 flow [2025-01-09 21:30:20,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 535 places, 550 transitions, 1118 flow [2025-01-09 21:30:20,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:20,418 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;@4d221b78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:20,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2025-01-09 21:30:20,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:20,428 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2025-01-09 21:30:20,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:20,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:20,429 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-01-09 21:30:20,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:20,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1318108895, now seen corresponding path program 1 times [2025-01-09 21:30:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25838511] [2025-01-09 21:30:20,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:20,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:30:20,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:30:20,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:20,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:20,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:20,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25838511] [2025-01-09 21:30:20,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25838511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:20,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:20,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014850084] [2025-01-09 21:30:20,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:20,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:20,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:20,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:20,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:20,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-01-09 21:30:20,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 550 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:20,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:20,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-01-09 21:30:20,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:20,963 INFO L124 PetriNetUnfolderBase]: 19/750 cut-off events. [2025-01-09 21:30:20,964 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-01-09 21:30:20,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 750 events. 19/750 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2696 event pairs, 5 based on Foata normal form. 37/685 useless extension candidates. Maximal degree in co-relation 544. Up to 22 conditions per place. [2025-01-09 21:30:20,981 INFO L140 encePairwiseOnDemand]: 556/574 looper letters, 11 selfloop transitions, 2 changer transitions 6/534 dead transitions. [2025-01-09 21:30:20,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 534 transitions, 1112 flow [2025-01-09 21:30:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1655 transitions. [2025-01-09 21:30:21,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9610917537746806 [2025-01-09 21:30:21,005 INFO L175 Difference]: Start difference. First operand has 535 places, 550 transitions, 1118 flow. Second operand 3 states and 1655 transitions. [2025-01-09 21:30:21,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 534 transitions, 1112 flow [2025-01-09 21:30:21,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 534 transitions, 1100 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:21,030 INFO L231 Difference]: Finished difference. Result has 530 places, 528 transitions, 1066 flow [2025-01-09 21:30:21,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=530, PETRI_TRANSITIONS=528} [2025-01-09 21:30:21,037 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -5 predicate places. [2025-01-09 21:30:21,038 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 528 transitions, 1066 flow [2025-01-09 21:30:21,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:21,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:21,039 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-01-09 21:30:21,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:21,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:21,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash 962348784, now seen corresponding path program 1 times [2025-01-09 21:30:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483370541] [2025-01-09 21:30:21,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:21,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:30:21,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:30:21,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:21,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483370541] [2025-01-09 21:30:21,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483370541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:21,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:21,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381874274] [2025-01-09 21:30:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:21,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:21,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:21,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:21,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:22,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 574 [2025-01-09 21:30:22,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 528 transitions, 1066 flow. Second operand has 6 states, 6 states have (on average 486.5) internal successors, (2919), 6 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:22,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:22,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 574 [2025-01-09 21:30:22,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,009 INFO L124 PetriNetUnfolderBase]: 2075/15175 cut-off events. [2025-01-09 21:30:25,010 INFO L125 PetriNetUnfolderBase]: For 179/181 co-relation queries the response was YES. [2025-01-09 21:30:25,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18105 conditions, 15175 events. 2075/15175 cut-off events. For 179/181 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 183964 event pairs, 1520 based on Foata normal form. 0/12811 useless extension candidates. Maximal degree in co-relation 18020. Up to 2820 conditions per place. [2025-01-09 21:30:25,198 INFO L140 encePairwiseOnDemand]: 556/574 looper letters, 54 selfloop transitions, 15 changer transitions 0/525 dead transitions. [2025-01-09 21:30:25,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 525 transitions, 1198 flow [2025-01-09 21:30:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2982 transitions. [2025-01-09 21:30:25,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8658536585365854 [2025-01-09 21:30:25,214 INFO L175 Difference]: Start difference. First operand has 530 places, 528 transitions, 1066 flow. Second operand 6 states and 2982 transitions. [2025-01-09 21:30:25,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 525 transitions, 1198 flow [2025-01-09 21:30:25,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 525 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:25,224 INFO L231 Difference]: Finished difference. Result has 524 places, 525 transitions, 1086 flow [2025-01-09 21:30:25,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1086, PETRI_PLACES=524, PETRI_TRANSITIONS=525} [2025-01-09 21:30:25,226 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -11 predicate places. [2025-01-09 21:30:25,226 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 525 transitions, 1086 flow [2025-01-09 21:30:25,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 486.5) internal successors, (2919), 6 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,229 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:25,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:25,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:25,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1881290452, now seen corresponding path program 1 times [2025-01-09 21:30:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407203025] [2025-01-09 21:30:25,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 21:30:25,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 21:30:25,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:25,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407203025] [2025-01-09 21:30:25,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407203025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314149806] [2025-01-09 21:30:25,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-01-09 21:30:25,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 525 transitions, 1086 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-01-09 21:30:25,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,539 INFO L124 PetriNetUnfolderBase]: 25/947 cut-off events. [2025-01-09 21:30:25,539 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-01-09 21:30:25,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 947 events. 25/947 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3822 event pairs, 7 based on Foata normal form. 0/820 useless extension candidates. Maximal degree in co-relation 950. Up to 25 conditions per place. [2025-01-09 21:30:25,555 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-01-09 21:30:25,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 524 transitions, 1110 flow [2025-01-09 21:30:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-01-09 21:30:25,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-01-09 21:30:25,560 INFO L175 Difference]: Start difference. First operand has 524 places, 525 transitions, 1086 flow. Second operand 3 states and 1640 transitions. [2025-01-09 21:30:25,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 524 transitions, 1110 flow [2025-01-09 21:30:25,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 524 transitions, 1080 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:25,568 INFO L231 Difference]: Finished difference. Result has 520 places, 524 transitions, 1058 flow [2025-01-09 21:30:25,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=520, PETRI_TRANSITIONS=524} [2025-01-09 21:30:25,570 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -15 predicate places. [2025-01-09 21:30:25,570 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 524 transitions, 1058 flow [2025-01-09 21:30:25,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:25,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:25,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:25,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash -81000630, now seen corresponding path program 1 times [2025-01-09 21:30:25,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740342435] [2025-01-09 21:30:25,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:30:25,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:30:25,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740342435] [2025-01-09 21:30:25,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740342435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11308590] [2025-01-09 21:30:25,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-01-09 21:30:25,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 524 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-01-09 21:30:25,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,841 INFO L124 PetriNetUnfolderBase]: 19/637 cut-off events. [2025-01-09 21:30:25,841 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:30:25,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 637 events. 19/637 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2018 event pairs, 7 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 552. Up to 25 conditions per place. [2025-01-09 21:30:25,853 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/523 dead transitions. [2025-01-09 21:30:25,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 523 transitions, 1082 flow [2025-01-09 21:30:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-01-09 21:30:25,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-01-09 21:30:25,858 INFO L175 Difference]: Start difference. First operand has 520 places, 524 transitions, 1058 flow. Second operand 3 states and 1640 transitions. [2025-01-09 21:30:25,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 523 transitions, 1082 flow [2025-01-09 21:30:25,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 523 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:25,870 INFO L231 Difference]: Finished difference. Result has 519 places, 523 transitions, 1056 flow [2025-01-09 21:30:25,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=519, PETRI_TRANSITIONS=523} [2025-01-09 21:30:25,872 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -16 predicate places. [2025-01-09 21:30:25,872 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 523 transitions, 1056 flow [2025-01-09 21:30:25,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:25,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:25,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:25,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2027925902, now seen corresponding path program 1 times [2025-01-09 21:30:25,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708985555] [2025-01-09 21:30:25,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:25,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:25,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:25,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708985555] [2025-01-09 21:30:25,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708985555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:25,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285532437] [2025-01-09 21:30:25,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:25,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:25,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:25,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-01-09 21:30:25,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 523 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:25,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-01-09 21:30:25,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:26,181 INFO L124 PetriNetUnfolderBase]: 21/826 cut-off events. [2025-01-09 21:30:26,181 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:26,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 826 events. 21/826 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3378 event pairs, 5 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 692. Up to 22 conditions per place. [2025-01-09 21:30:26,193 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-01-09 21:30:26,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 522 transitions, 1080 flow [2025-01-09 21:30:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-01-09 21:30:26,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-01-09 21:30:26,200 INFO L175 Difference]: Start difference. First operand has 519 places, 523 transitions, 1056 flow. Second operand 3 states and 1640 transitions. [2025-01-09 21:30:26,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 522 transitions, 1080 flow [2025-01-09 21:30:26,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 522 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:26,210 INFO L231 Difference]: Finished difference. Result has 518 places, 522 transitions, 1054 flow [2025-01-09 21:30:26,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1054, PETRI_PLACES=518, PETRI_TRANSITIONS=522} [2025-01-09 21:30:26,212 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -17 predicate places. [2025-01-09 21:30:26,212 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 522 transitions, 1054 flow [2025-01-09 21:30:26,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:26,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:26,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:26,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:26,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:26,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1177263081, now seen corresponding path program 1 times [2025-01-09 21:30:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:26,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920858765] [2025-01-09 21:30:26,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:26,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:30:26,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:30:26,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:26,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:26,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920858765] [2025-01-09 21:30:26,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920858765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:26,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:26,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:26,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830576076] [2025-01-09 21:30:26,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:26,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:26,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:26,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:26,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:26,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-01-09 21:30:26,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 522 transitions, 1054 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:26,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:26,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-01-09 21:30:26,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:26,464 INFO L124 PetriNetUnfolderBase]: 27/1034 cut-off events. [2025-01-09 21:30:26,464 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-01-09 21:30:26,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 1034 events. 27/1034 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4732 event pairs, 7 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 897. Up to 25 conditions per place. [2025-01-09 21:30:26,482 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-01-09 21:30:26,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 521 transitions, 1078 flow [2025-01-09 21:30:26,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-01-09 21:30:26,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-01-09 21:30:26,486 INFO L175 Difference]: Start difference. First operand has 518 places, 522 transitions, 1054 flow. Second operand 3 states and 1640 transitions. [2025-01-09 21:30:26,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 521 transitions, 1078 flow [2025-01-09 21:30:26,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 521 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:26,493 INFO L231 Difference]: Finished difference. Result has 517 places, 521 transitions, 1052 flow [2025-01-09 21:30:26,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=517, PETRI_TRANSITIONS=521} [2025-01-09 21:30:26,495 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-01-09 21:30:26,496 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 521 transitions, 1052 flow [2025-01-09 21:30:26,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:26,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:26,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:26,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:26,498 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:26,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:26,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1409841597, now seen corresponding path program 1 times [2025-01-09 21:30:26,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:26,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959540031] [2025-01-09 21:30:26,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:26,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:26,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:30:26,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:30:26,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:26,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:26,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959540031] [2025-01-09 21:30:26,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959540031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:26,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:26,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:26,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706424437] [2025-01-09 21:30:26,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:26,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:26,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:26,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:26,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-01-09 21:30:26,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 521 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:26,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:26,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-01-09 21:30:26,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:26,706 INFO L124 PetriNetUnfolderBase]: 25/898 cut-off events. [2025-01-09 21:30:26,707 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-01-09 21:30:26,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 898 events. 25/898 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3214 event pairs, 7 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 750. Up to 25 conditions per place. [2025-01-09 21:30:26,720 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-01-09 21:30:26,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 520 transitions, 1076 flow [2025-01-09 21:30:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-01-09 21:30:26,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-01-09 21:30:26,724 INFO L175 Difference]: Start difference. First operand has 517 places, 521 transitions, 1052 flow. Second operand 3 states and 1640 transitions. [2025-01-09 21:30:26,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 520 transitions, 1076 flow [2025-01-09 21:30:26,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 520 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:26,732 INFO L231 Difference]: Finished difference. Result has 516 places, 520 transitions, 1050 flow [2025-01-09 21:30:26,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=516, PETRI_TRANSITIONS=520} [2025-01-09 21:30:26,734 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-01-09 21:30:26,734 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 520 transitions, 1050 flow [2025-01-09 21:30:26,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:26,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:26,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:26,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:26,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:26,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1433574191, now seen corresponding path program 1 times [2025-01-09 21:30:26,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:26,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412351807] [2025-01-09 21:30:26,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:26,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:30:26,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:30:26,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:26,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:26,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:26,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412351807] [2025-01-09 21:30:26,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412351807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:26,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:26,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:26,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554390780] [2025-01-09 21:30:26,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:26,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:26,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:26,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:26,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:26,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-01-09 21:30:26,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 520 transitions, 1050 flow. Second operand has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:26,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:26,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-01-09 21:30:26,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:26,987 INFO L124 PetriNetUnfolderBase]: 36/1226 cut-off events. [2025-01-09 21:30:26,988 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:30:27,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 1226 events. 36/1226 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6553 event pairs, 8 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 1082. Up to 31 conditions per place. [2025-01-09 21:30:27,013 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-01-09 21:30:27,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 522 transitions, 1086 flow [2025-01-09 21:30:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-01-09 21:30:27,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-01-09 21:30:27,017 INFO L175 Difference]: Start difference. First operand has 516 places, 520 transitions, 1050 flow. Second operand 3 states and 1649 transitions. [2025-01-09 21:30:27,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 522 transitions, 1086 flow [2025-01-09 21:30:27,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 522 transitions, 1082 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:27,031 INFO L231 Difference]: Finished difference. Result has 515 places, 520 transitions, 1056 flow [2025-01-09 21:30:27,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=515, PETRI_TRANSITIONS=520} [2025-01-09 21:30:27,032 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -20 predicate places. [2025-01-09 21:30:27,034 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 520 transitions, 1056 flow [2025-01-09 21:30:27,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:27,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:27,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:27,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:27,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:27,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:27,036 INFO L85 PathProgramCache]: Analyzing trace with hash 920158240, now seen corresponding path program 1 times [2025-01-09 21:30:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:27,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197854290] [2025-01-09 21:30:27,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:27,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:30:27,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:30:27,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:27,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:27,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197854290] [2025-01-09 21:30:27,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197854290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:27,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:27,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:27,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220052416] [2025-01-09 21:30:27,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:27,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:27,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:27,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:27,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:27,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-01-09 21:30:27,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 520 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:27,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:27,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-01-09 21:30:27,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:27,338 INFO L124 PetriNetUnfolderBase]: 49/1359 cut-off events. [2025-01-09 21:30:27,339 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:27,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 1359 events. 49/1359 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8211 event pairs, 5 based on Foata normal form. 0/1184 useless extension candidates. Maximal degree in co-relation 1127. Up to 43 conditions per place. [2025-01-09 21:30:27,363 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-01-09 21:30:27,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 522 transitions, 1092 flow [2025-01-09 21:30:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-01-09 21:30:27,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-01-09 21:30:27,368 INFO L175 Difference]: Start difference. First operand has 515 places, 520 transitions, 1056 flow. Second operand 3 states and 1649 transitions. [2025-01-09 21:30:27,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 522 transitions, 1092 flow [2025-01-09 21:30:27,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 522 transitions, 1092 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:27,376 INFO L231 Difference]: Finished difference. Result has 516 places, 520 transitions, 1066 flow [2025-01-09 21:30:27,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=516, PETRI_TRANSITIONS=520} [2025-01-09 21:30:27,378 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-01-09 21:30:27,378 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 520 transitions, 1066 flow [2025-01-09 21:30:27,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:27,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:27,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:27,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:27,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1740042694, now seen corresponding path program 1 times [2025-01-09 21:30:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44837797] [2025-01-09 21:30:27,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:27,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:30:27,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:30:27,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:27,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:27,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:27,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44837797] [2025-01-09 21:30:27,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44837797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:27,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:27,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:27,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589615304] [2025-01-09 21:30:27,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:27,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:27,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:27,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:27,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:27,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-01-09 21:30:27,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 520 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 542.3333333333334) internal successors, (1627), 3 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:27,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:27,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-01-09 21:30:27,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:27,651 INFO L124 PetriNetUnfolderBase]: 51/1185 cut-off events. [2025-01-09 21:30:27,652 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:27,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1185 events. 51/1185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6441 event pairs, 18 based on Foata normal form. 0/1038 useless extension candidates. Maximal degree in co-relation 1002. Up to 57 conditions per place. [2025-01-09 21:30:27,672 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-01-09 21:30:27,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 521 transitions, 1104 flow [2025-01-09 21:30:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-01-09 21:30:27,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-01-09 21:30:27,676 INFO L175 Difference]: Start difference. First operand has 516 places, 520 transitions, 1066 flow. Second operand 3 states and 1641 transitions. [2025-01-09 21:30:27,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 521 transitions, 1104 flow [2025-01-09 21:30:27,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 521 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:27,684 INFO L231 Difference]: Finished difference. Result has 517 places, 519 transitions, 1068 flow [2025-01-09 21:30:27,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=517, PETRI_TRANSITIONS=519} [2025-01-09 21:30:27,686 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-01-09 21:30:27,686 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 519 transitions, 1068 flow [2025-01-09 21:30:27,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.3333333333334) internal successors, (1627), 3 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:27,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:27,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:27,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:27,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:27,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1684699686, now seen corresponding path program 1 times [2025-01-09 21:30:27,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:27,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253707255] [2025-01-09 21:30:27,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:27,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:27,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 21:30:27,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 21:30:27,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:27,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253707255] [2025-01-09 21:30:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253707255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:27,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:27,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562161862] [2025-01-09 21:30:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:27,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:27,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:27,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:27,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:27,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-01-09 21:30:27,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 519 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:27,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:27,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-01-09 21:30:27,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:28,006 INFO L124 PetriNetUnfolderBase]: 68/1866 cut-off events. [2025-01-09 21:30:28,006 INFO L125 PetriNetUnfolderBase]: For 16/21 co-relation queries the response was YES. [2025-01-09 21:30:28,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 1866 events. 68/1866 cut-off events. For 16/21 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 12105 event pairs, 15 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 1556. Up to 56 conditions per place. [2025-01-09 21:30:28,035 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-01-09 21:30:28,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 521 transitions, 1104 flow [2025-01-09 21:30:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-01-09 21:30:28,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-01-09 21:30:28,039 INFO L175 Difference]: Start difference. First operand has 517 places, 519 transitions, 1068 flow. Second operand 3 states and 1649 transitions. [2025-01-09 21:30:28,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 521 transitions, 1104 flow [2025-01-09 21:30:28,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 521 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:28,047 INFO L231 Difference]: Finished difference. Result has 516 places, 519 transitions, 1074 flow [2025-01-09 21:30:28,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=516, PETRI_TRANSITIONS=519} [2025-01-09 21:30:28,049 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-01-09 21:30:28,049 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 519 transitions, 1074 flow [2025-01-09 21:30:28,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:28,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:28,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:28,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:28,050 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:28,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash -698656770, now seen corresponding path program 1 times [2025-01-09 21:30:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:28,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215743454] [2025-01-09 21:30:28,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:28,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:30:28,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:30:28,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:28,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:28,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:28,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215743454] [2025-01-09 21:30:28,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215743454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:28,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:28,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:28,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123372143] [2025-01-09 21:30:28,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:28,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:28,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:28,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:28,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:28,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-01-09 21:30:28,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 519 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:28,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:28,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-01-09 21:30:28,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:28,443 INFO L124 PetriNetUnfolderBase]: 101/2286 cut-off events. [2025-01-09 21:30:28,443 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-01-09 21:30:28,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 2286 events. 101/2286 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 15797 event pairs, 6 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 1997. Up to 104 conditions per place. [2025-01-09 21:30:28,478 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 16 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-01-09 21:30:28,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 524 transitions, 1125 flow [2025-01-09 21:30:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1652 transitions. [2025-01-09 21:30:28,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959349593495935 [2025-01-09 21:30:28,482 INFO L175 Difference]: Start difference. First operand has 516 places, 519 transitions, 1074 flow. Second operand 3 states and 1652 transitions. [2025-01-09 21:30:28,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 524 transitions, 1125 flow [2025-01-09 21:30:28,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 524 transitions, 1125 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:28,491 INFO L231 Difference]: Finished difference. Result has 517 places, 519 transitions, 1084 flow [2025-01-09 21:30:28,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=517, PETRI_TRANSITIONS=519} [2025-01-09 21:30:28,492 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-01-09 21:30:28,492 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 519 transitions, 1084 flow [2025-01-09 21:30:28,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:28,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:28,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:28,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:28,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:28,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash -183553874, now seen corresponding path program 1 times [2025-01-09 21:30:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782585975] [2025-01-09 21:30:28,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:28,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:30:28,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:30:28,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:28,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:28,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782585975] [2025-01-09 21:30:28,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782585975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692977703] [2025-01-09 21:30:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:28,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:28,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:28,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:28,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:28,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-01-09 21:30:28,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 519 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:28,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:28,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-01-09 21:30:28,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:29,018 INFO L124 PetriNetUnfolderBase]: 118/2771 cut-off events. [2025-01-09 21:30:29,018 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-01-09 21:30:29,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3033 conditions, 2771 events. 118/2771 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 20133 event pairs, 15 based on Foata normal form. 0/2426 useless extension candidates. Maximal degree in co-relation 2596. Up to 57 conditions per place. [2025-01-09 21:30:29,072 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 15 selfloop transitions, 5 changer transitions 0/521 dead transitions. [2025-01-09 21:30:29,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 521 transitions, 1130 flow [2025-01-09 21:30:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-01-09 21:30:29,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-01-09 21:30:29,076 INFO L175 Difference]: Start difference. First operand has 517 places, 519 transitions, 1084 flow. Second operand 3 states and 1640 transitions. [2025-01-09 21:30:29,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 521 transitions, 1130 flow [2025-01-09 21:30:29,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 521 transitions, 1130 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:29,084 INFO L231 Difference]: Finished difference. Result has 518 places, 519 transitions, 1110 flow [2025-01-09 21:30:29,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=518, PETRI_TRANSITIONS=519} [2025-01-09 21:30:29,086 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -17 predicate places. [2025-01-09 21:30:29,086 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 519 transitions, 1110 flow [2025-01-09 21:30:29,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:29,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:29,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:29,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:29,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:29,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1913487460, now seen corresponding path program 1 times [2025-01-09 21:30:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:29,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644577570] [2025-01-09 21:30:29,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:29,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:29,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:30:29,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:30:29,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:29,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:29,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:29,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644577570] [2025-01-09 21:30:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644577570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130779894] [2025-01-09 21:30:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:29,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:29,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:29,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:29,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-01-09 21:30:29,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 519 transitions, 1110 flow. Second operand has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:29,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:29,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-01-09 21:30:29,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:29,698 INFO L124 PetriNetUnfolderBase]: 92/2232 cut-off events. [2025-01-09 21:30:29,698 INFO L125 PetriNetUnfolderBase]: For 36/118 co-relation queries the response was YES. [2025-01-09 21:30:29,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 2232 events. 92/2232 cut-off events. For 36/118 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14603 event pairs, 22 based on Foata normal form. 2/1934 useless extension candidates. Maximal degree in co-relation 1879. Up to 58 conditions per place. [2025-01-09 21:30:29,738 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-01-09 21:30:29,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 520 transitions, 1148 flow [2025-01-09 21:30:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-01-09 21:30:29,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-01-09 21:30:29,743 INFO L175 Difference]: Start difference. First operand has 518 places, 519 transitions, 1110 flow. Second operand 3 states and 1641 transitions. [2025-01-09 21:30:29,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 520 transitions, 1148 flow [2025-01-09 21:30:29,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 520 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:29,751 INFO L231 Difference]: Finished difference. Result has 517 places, 518 transitions, 1102 flow [2025-01-09 21:30:29,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=517, PETRI_TRANSITIONS=518} [2025-01-09 21:30:29,753 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-01-09 21:30:29,753 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 518 transitions, 1102 flow [2025-01-09 21:30:29,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:29,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:29,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:29,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:29,754 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:29,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:29,755 INFO L85 PathProgramCache]: Analyzing trace with hash -729193278, now seen corresponding path program 1 times [2025-01-09 21:30:29,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:29,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415516987] [2025-01-09 21:30:29,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:29,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:30:29,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:30:29,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:29,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415516987] [2025-01-09 21:30:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415516987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:30:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441708352] [2025-01-09 21:30:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:29,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:30:29,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:29,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:30:29,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:30:29,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-01-09 21:30:29,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 518 transitions, 1102 flow. Second operand has 4 states, 4 states have (on average 544.25) internal successors, (2177), 4 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:29,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:29,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-01-09 21:30:29,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,450 INFO L124 PetriNetUnfolderBase]: 124/3253 cut-off events. [2025-01-09 21:30:30,451 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-01-09 21:30:30,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 3253 events. 124/3253 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 24199 event pairs, 24 based on Foata normal form. 2/2851 useless extension candidates. Maximal degree in co-relation 3439. Up to 67 conditions per place. [2025-01-09 21:30:30,498 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 27 selfloop transitions, 4 changer transitions 0/534 dead transitions. [2025-01-09 21:30:30,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 534 transitions, 1206 flow [2025-01-09 21:30:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2747 transitions. [2025-01-09 21:30:30,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571428571428572 [2025-01-09 21:30:30,504 INFO L175 Difference]: Start difference. First operand has 517 places, 518 transitions, 1102 flow. Second operand 5 states and 2747 transitions. [2025-01-09 21:30:30,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 534 transitions, 1206 flow [2025-01-09 21:30:30,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 534 transitions, 1202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:30,513 INFO L231 Difference]: Finished difference. Result has 522 places, 520 transitions, 1123 flow [2025-01-09 21:30:30,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1123, PETRI_PLACES=522, PETRI_TRANSITIONS=520} [2025-01-09 21:30:30,514 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -13 predicate places. [2025-01-09 21:30:30,514 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 520 transitions, 1123 flow [2025-01-09 21:30:30,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.25) internal successors, (2177), 4 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:30,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:30,516 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:30,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1064918439, now seen corresponding path program 1 times [2025-01-09 21:30:30,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647564958] [2025-01-09 21:30:30,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:30:30,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:30:30,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:30,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-01-09 21:30:30,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:30,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647564958] [2025-01-09 21:30:30,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647564958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:30,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:30,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:30,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565562287] [2025-01-09 21:30:30,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:30,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:30:30,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:30,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:30:30,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:30:30,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 574 [2025-01-09 21:30:30,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 520 transitions, 1123 flow. Second operand has 5 states, 5 states have (on average 529.0) internal successors, (2645), 5 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 574 [2025-01-09 21:30:30,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,096 INFO L124 PetriNetUnfolderBase]: 47/1670 cut-off events. [2025-01-09 21:30:31,097 INFO L125 PetriNetUnfolderBase]: For 11/22 co-relation queries the response was YES. [2025-01-09 21:30:31,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1670 events. 47/1670 cut-off events. For 11/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8779 event pairs, 3 based on Foata normal form. 3/1481 useless extension candidates. Maximal degree in co-relation 1699. Up to 30 conditions per place. [2025-01-09 21:30:31,118 INFO L140 encePairwiseOnDemand]: 553/574 looper letters, 18 selfloop transitions, 18 changer transitions 0/523 dead transitions. [2025-01-09 21:30:31,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 523 transitions, 1201 flow [2025-01-09 21:30:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2659 transitions. [2025-01-09 21:30:31,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9264808362369338 [2025-01-09 21:30:31,123 INFO L175 Difference]: Start difference. First operand has 522 places, 520 transitions, 1123 flow. Second operand 5 states and 2659 transitions. [2025-01-09 21:30:31,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 523 transitions, 1201 flow [2025-01-09 21:30:31,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 523 transitions, 1201 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:31,131 INFO L231 Difference]: Finished difference. Result has 527 places, 523 transitions, 1183 flow [2025-01-09 21:30:31,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1183, PETRI_PLACES=527, PETRI_TRANSITIONS=523} [2025-01-09 21:30:31,132 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -8 predicate places. [2025-01-09 21:30:31,132 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 523 transitions, 1183 flow [2025-01-09 21:30:31,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 529.0) internal successors, (2645), 5 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:31,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:31,134 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash 860438566, now seen corresponding path program 1 times [2025-01-09 21:30:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254656482] [2025-01-09 21:30:31,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:30:31,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:30:31,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:31,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254656482] [2025-01-09 21:30:31,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254656482] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:30:31,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745183062] [2025-01-09 21:30:31,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:31,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:31,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:30:31,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:30:31,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:30:31,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:30:31,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:30:31,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:30:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:31,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:30:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:31,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745183062] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:30:31,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:30:31,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-09 21:30:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473788145] [2025-01-09 21:30:31,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:30:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:30:31,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:30:32,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 574 [2025-01-09 21:30:32,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 523 transitions, 1183 flow. Second operand has 15 states, 15 states have (on average 518.4666666666667) internal successors, (7777), 15 states have internal predecessors, (7777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:32,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 574 [2025-01-09 21:30:32,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,933 INFO L124 PetriNetUnfolderBase]: 47/1721 cut-off events. [2025-01-09 21:30:32,933 INFO L125 PetriNetUnfolderBase]: For 26/37 co-relation queries the response was YES. [2025-01-09 21:30:32,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 1721 events. 47/1721 cut-off events. For 26/37 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8706 event pairs, 3 based on Foata normal form. 6/1535 useless extension candidates. Maximal degree in co-relation 1813. Up to 30 conditions per place. [2025-01-09 21:30:32,956 INFO L140 encePairwiseOnDemand]: 544/574 looper letters, 30 selfloop transitions, 39 changer transitions 0/547 dead transitions. [2025-01-09 21:30:32,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 547 transitions, 1375 flow [2025-01-09 21:30:32,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:32,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5740 transitions. [2025-01-09 21:30:32,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-01-09 21:30:32,962 INFO L175 Difference]: Start difference. First operand has 527 places, 523 transitions, 1183 flow. Second operand 11 states and 5740 transitions. [2025-01-09 21:30:32,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 547 transitions, 1375 flow [2025-01-09 21:30:32,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 547 transitions, 1345 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:30:32,971 INFO L231 Difference]: Finished difference. Result has 537 places, 541 transitions, 1333 flow [2025-01-09 21:30:32,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1333, PETRI_PLACES=537, PETRI_TRANSITIONS=541} [2025-01-09 21:30:32,972 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 2 predicate places. [2025-01-09 21:30:32,972 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 541 transitions, 1333 flow [2025-01-09 21:30:32,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 518.4666666666667) internal successors, (7777), 15 states have internal predecessors, (7777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:32,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,975 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:32,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:30:33,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 21:30:33,176 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:33,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash 676234118, now seen corresponding path program 2 times [2025-01-09 21:30:33,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:33,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941247031] [2025-01-09 21:30:33,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:30:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:33,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-01-09 21:30:33,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 171 of 306 statements. [2025-01-09 21:30:33,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:30:33,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:33,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:33,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941247031] [2025-01-09 21:30:33,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941247031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:33,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:33,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:33,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017272647] [2025-01-09 21:30:33,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:33,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:33,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:33,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:33,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:34,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-01-09 21:30:34,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 541 transitions, 1333 flow. Second operand has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-01-09 21:30:34,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,740 INFO L124 PetriNetUnfolderBase]: 100/2649 cut-off events. [2025-01-09 21:30:34,740 INFO L125 PetriNetUnfolderBase]: For 63/70 co-relation queries the response was YES. [2025-01-09 21:30:34,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3133 conditions, 2649 events. 100/2649 cut-off events. For 63/70 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 17556 event pairs, 9 based on Foata normal form. 0/2363 useless extension candidates. Maximal degree in co-relation 2994. Up to 79 conditions per place. [2025-01-09 21:30:34,793 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 30 selfloop transitions, 6 changer transitions 0/548 dead transitions. [2025-01-09 21:30:34,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 548 transitions, 1427 flow [2025-01-09 21:30:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3210 transitions. [2025-01-09 21:30:34,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320557491289199 [2025-01-09 21:30:34,798 INFO L175 Difference]: Start difference. First operand has 537 places, 541 transitions, 1333 flow. Second operand 6 states and 3210 transitions. [2025-01-09 21:30:34,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 548 transitions, 1427 flow [2025-01-09 21:30:34,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 548 transitions, 1391 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-09 21:30:34,808 INFO L231 Difference]: Finished difference. Result has 538 places, 540 transitions, 1307 flow [2025-01-09 21:30:34,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1307, PETRI_PLACES=538, PETRI_TRANSITIONS=540} [2025-01-09 21:30:34,809 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 3 predicate places. [2025-01-09 21:30:34,810 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 540 transitions, 1307 flow [2025-01-09 21:30:34,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,811 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:34,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:34,812 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:34,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash 571234116, now seen corresponding path program 1 times [2025-01-09 21:30:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983552082] [2025-01-09 21:30:34,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 21:30:34,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 21:30:34,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:34,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983552082] [2025-01-09 21:30:34,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983552082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902592701] [2025-01-09 21:30:34,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-01-09 21:30:34,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 540 transitions, 1307 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-01-09 21:30:34,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,780 INFO L124 PetriNetUnfolderBase]: 188/4852 cut-off events. [2025-01-09 21:30:35,780 INFO L125 PetriNetUnfolderBase]: For 71/76 co-relation queries the response was YES. [2025-01-09 21:30:35,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5475 conditions, 4852 events. 188/4852 cut-off events. For 71/76 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 39309 event pairs, 45 based on Foata normal form. 1/4262 useless extension candidates. Maximal degree in co-relation 5146. Up to 128 conditions per place. [2025-01-09 21:30:35,837 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 17 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2025-01-09 21:30:35,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 541 transitions, 1349 flow [2025-01-09 21:30:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-01-09 21:30:35,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-01-09 21:30:35,840 INFO L175 Difference]: Start difference. First operand has 538 places, 540 transitions, 1307 flow. Second operand 3 states and 1641 transitions. [2025-01-09 21:30:35,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 541 transitions, 1349 flow [2025-01-09 21:30:35,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 541 transitions, 1337 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:35,846 INFO L231 Difference]: Finished difference. Result has 534 places, 539 transitions, 1297 flow [2025-01-09 21:30:35,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1297, PETRI_PLACES=534, PETRI_TRANSITIONS=539} [2025-01-09 21:30:35,847 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -1 predicate places. [2025-01-09 21:30:35,847 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 539 transitions, 1297 flow [2025-01-09 21:30:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:35,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,848 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:35,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:35,848 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:35,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1412299886, now seen corresponding path program 1 times [2025-01-09 21:30:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820558612] [2025-01-09 21:30:35,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 21:30:35,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 21:30:35,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:35,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820558612] [2025-01-09 21:30:35,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820558612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448628990] [2025-01-09 21:30:35,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-01-09 21:30:35,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 539 transitions, 1297 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:35,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-01-09 21:30:35,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,809 INFO L124 PetriNetUnfolderBase]: 125/3167 cut-off events. [2025-01-09 21:30:36,809 INFO L125 PetriNetUnfolderBase]: For 59/80 co-relation queries the response was YES. [2025-01-09 21:30:36,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 3167 events. 125/3167 cut-off events. For 59/80 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22629 event pairs, 15 based on Foata normal form. 1/2847 useless extension candidates. Maximal degree in co-relation 3333. Up to 118 conditions per place. [2025-01-09 21:30:36,842 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 16 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2025-01-09 21:30:36,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 544 transitions, 1348 flow [2025-01-09 21:30:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1652 transitions. [2025-01-09 21:30:36,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959349593495935 [2025-01-09 21:30:36,845 INFO L175 Difference]: Start difference. First operand has 534 places, 539 transitions, 1297 flow. Second operand 3 states and 1652 transitions. [2025-01-09 21:30:36,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 544 transitions, 1348 flow [2025-01-09 21:30:36,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 544 transitions, 1344 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:36,853 INFO L231 Difference]: Finished difference. Result has 533 places, 539 transitions, 1303 flow [2025-01-09 21:30:36,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1303, PETRI_PLACES=533, PETRI_TRANSITIONS=539} [2025-01-09 21:30:36,854 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -2 predicate places. [2025-01-09 21:30:36,855 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 539 transitions, 1303 flow [2025-01-09 21:30:36,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:36,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,856 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:36,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:36,856 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:36,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,857 INFO L85 PathProgramCache]: Analyzing trace with hash 678225245, now seen corresponding path program 1 times [2025-01-09 21:30:36,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629025057] [2025-01-09 21:30:36,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 21:30:36,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 21:30:36,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:36,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629025057] [2025-01-09 21:30:36,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629025057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105885628] [2025-01-09 21:30:36,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:37,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-01-09 21:30:37,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 539 transitions, 1303 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:37,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:37,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-01-09 21:30:37,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:37,876 INFO L124 PetriNetUnfolderBase]: 248/3205 cut-off events. [2025-01-09 21:30:37,877 INFO L125 PetriNetUnfolderBase]: For 185/237 co-relation queries the response was YES. [2025-01-09 21:30:37,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 3205 events. 248/3205 cut-off events. For 185/237 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 25413 event pairs, 54 based on Foata normal form. 0/2769 useless extension candidates. Maximal degree in co-relation 3514. Up to 320 conditions per place. [2025-01-09 21:30:37,935 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/540 dead transitions. [2025-01-09 21:30:37,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 540 transitions, 1341 flow [2025-01-09 21:30:37,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-01-09 21:30:37,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-01-09 21:30:37,937 INFO L175 Difference]: Start difference. First operand has 533 places, 539 transitions, 1303 flow. Second operand 3 states and 1641 transitions. [2025-01-09 21:30:37,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 540 transitions, 1341 flow [2025-01-09 21:30:37,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 540 transitions, 1341 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:37,944 INFO L231 Difference]: Finished difference. Result has 534 places, 538 transitions, 1305 flow [2025-01-09 21:30:37,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=534, PETRI_TRANSITIONS=538} [2025-01-09 21:30:37,945 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -1 predicate places. [2025-01-09 21:30:37,945 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 538 transitions, 1305 flow [2025-01-09 21:30:37,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:37,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:37,946 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:37,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:30:37,946 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:37,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:37,947 INFO L85 PathProgramCache]: Analyzing trace with hash 831593125, now seen corresponding path program 1 times [2025-01-09 21:30:37,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:37,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434019670] [2025-01-09 21:30:37,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:37,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:37,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 21:30:37,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 21:30:37,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:37,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:38,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:38,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434019670] [2025-01-09 21:30:38,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434019670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:38,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:38,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:38,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89487071] [2025-01-09 21:30:38,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:38,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:38,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:38,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:38,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:38,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-01-09 21:30:38,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 538 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 540.6666666666666) internal successors, (1622), 3 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:38,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:38,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-01-09 21:30:38,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:38,860 INFO L124 PetriNetUnfolderBase]: 181/4365 cut-off events. [2025-01-09 21:30:38,861 INFO L125 PetriNetUnfolderBase]: For 75/238 co-relation queries the response was YES. [2025-01-09 21:30:38,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4918 conditions, 4365 events. 181/4365 cut-off events. For 75/238 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 33216 event pairs, 26 based on Foata normal form. 0/3856 useless extension candidates. Maximal degree in co-relation 4588. Up to 82 conditions per place. [2025-01-09 21:30:38,924 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 15 selfloop transitions, 5 changer transitions 0/540 dead transitions. [2025-01-09 21:30:38,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 540 transitions, 1351 flow [2025-01-09 21:30:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-01-09 21:30:38,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-01-09 21:30:38,926 INFO L175 Difference]: Start difference. First operand has 534 places, 538 transitions, 1305 flow. Second operand 3 states and 1640 transitions. [2025-01-09 21:30:38,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 540 transitions, 1351 flow [2025-01-09 21:30:38,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 540 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:38,935 INFO L231 Difference]: Finished difference. Result has 533 places, 538 transitions, 1327 flow [2025-01-09 21:30:38,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1327, PETRI_PLACES=533, PETRI_TRANSITIONS=538} [2025-01-09 21:30:38,936 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -2 predicate places. [2025-01-09 21:30:38,936 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 538 transitions, 1327 flow [2025-01-09 21:30:38,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.6666666666666) internal successors, (1622), 3 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:38,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:38,937 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:38,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:38,937 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:38,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:38,938 INFO L85 PathProgramCache]: Analyzing trace with hash 650425074, now seen corresponding path program 1 times [2025-01-09 21:30:38,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:38,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794373065] [2025-01-09 21:30:38,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:38,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 21:30:38,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 21:30:38,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:38,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 21:30:39,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:39,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794373065] [2025-01-09 21:30:39,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794373065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:39,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:39,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:30:39,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350490737] [2025-01-09 21:30:39,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:39,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:30:39,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:39,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:30:39,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:30:39,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-01-09 21:30:39,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 538 transitions, 1327 flow. Second operand has 4 states, 4 states have (on average 544.5) internal successors, (2178), 4 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:39,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:39,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-01-09 21:30:39,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:40,199 INFO L124 PetriNetUnfolderBase]: 197/4935 cut-off events. [2025-01-09 21:30:40,199 INFO L125 PetriNetUnfolderBase]: For 140/347 co-relation queries the response was YES. [2025-01-09 21:30:40,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5650 conditions, 4935 events. 197/4935 cut-off events. For 140/347 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 40191 event pairs, 45 based on Foata normal form. 4/4378 useless extension candidates. Maximal degree in co-relation 5319. Up to 105 conditions per place. [2025-01-09 21:30:40,258 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 25 selfloop transitions, 4 changer transitions 0/552 dead transitions. [2025-01-09 21:30:40,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 552 transitions, 1421 flow [2025-01-09 21:30:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2745 transitions. [2025-01-09 21:30:40,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9564459930313589 [2025-01-09 21:30:40,261 INFO L175 Difference]: Start difference. First operand has 533 places, 538 transitions, 1327 flow. Second operand 5 states and 2745 transitions. [2025-01-09 21:30:40,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 552 transitions, 1421 flow [2025-01-09 21:30:40,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 552 transitions, 1411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:40,268 INFO L231 Difference]: Finished difference. Result has 538 places, 540 transitions, 1342 flow [2025-01-09 21:30:40,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1342, PETRI_PLACES=538, PETRI_TRANSITIONS=540} [2025-01-09 21:30:40,268 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 3 predicate places. [2025-01-09 21:30:40,268 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 540 transitions, 1342 flow [2025-01-09 21:30:40,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.5) internal successors, (2178), 4 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:40,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:40,269 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:40,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:40,270 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:40,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:40,271 INFO L85 PathProgramCache]: Analyzing trace with hash -266736457, now seen corresponding path program 1 times [2025-01-09 21:30:40,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:40,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080129402] [2025-01-09 21:30:40,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:40,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:40,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 21:30:40,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 21:30:40,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:40,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:40,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:40,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080129402] [2025-01-09 21:30:40,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080129402] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:30:40,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407610377] [2025-01-09 21:30:40,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:40,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:40,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:40,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:30:40,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:30:40,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 21:30:40,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 21:30:40,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:40,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:40,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 21:30:40,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:30:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:41,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:30:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:41,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407610377] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:30:41,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:30:41,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-01-09 21:30:41,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239716539] [2025-01-09 21:30:41,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:30:41,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 21:30:41,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:41,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 21:30:41,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-01-09 21:30:41,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 574 [2025-01-09 21:30:41,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 540 transitions, 1342 flow. Second operand has 22 states, 22 states have (on average 518.1363636363636) internal successors, (11399), 22 states have internal predecessors, (11399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:41,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:41,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 574 [2025-01-09 21:30:41,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:42,638 INFO L124 PetriNetUnfolderBase]: 58/2449 cut-off events. [2025-01-09 21:30:42,638 INFO L125 PetriNetUnfolderBase]: For 75/94 co-relation queries the response was YES. [2025-01-09 21:30:42,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 2449 events. 58/2449 cut-off events. For 75/94 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14422 event pairs, 7 based on Foata normal form. 6/2225 useless extension candidates. Maximal degree in co-relation 2673. Up to 44 conditions per place. [2025-01-09 21:30:42,663 INFO L140 encePairwiseOnDemand]: 544/574 looper letters, 36 selfloop transitions, 57 changer transitions 0/570 dead transitions. [2025-01-09 21:30:42,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 570 transitions, 1672 flow [2025-01-09 21:30:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 21:30:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 21:30:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 8854 transitions. [2025-01-09 21:30:42,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9073580651772905 [2025-01-09 21:30:42,675 INFO L175 Difference]: Start difference. First operand has 538 places, 540 transitions, 1342 flow. Second operand 17 states and 8854 transitions. [2025-01-09 21:30:42,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 570 transitions, 1672 flow [2025-01-09 21:30:42,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 570 transitions, 1672 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:42,684 INFO L231 Difference]: Finished difference. Result has 557 places, 561 transitions, 1618 flow [2025-01-09 21:30:42,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1618, PETRI_PLACES=557, PETRI_TRANSITIONS=561} [2025-01-09 21:30:42,685 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 22 predicate places. [2025-01-09 21:30:42,685 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 561 transitions, 1618 flow [2025-01-09 21:30:42,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 518.1363636363636) internal successors, (11399), 22 states have internal predecessors, (11399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:42,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:42,688 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:42,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:30:42,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:42,889 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:42,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash 767538133, now seen corresponding path program 1 times [2025-01-09 21:30:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:42,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631976848] [2025-01-09 21:30:42,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:42,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:42,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-01-09 21:30:42,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-09 21:30:42,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:42,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:43,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631976848] [2025-01-09 21:30:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631976848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:43,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:43,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:43,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750007272] [2025-01-09 21:30:43,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:43,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:43,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:43,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:43,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-01-09 21:30:43,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 561 transitions, 1618 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:43,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:43,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-01-09 21:30:43,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:44,854 INFO L124 PetriNetUnfolderBase]: 293/6678 cut-off events. [2025-01-09 21:30:44,854 INFO L125 PetriNetUnfolderBase]: For 268/801 co-relation queries the response was YES. [2025-01-09 21:30:44,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7715 conditions, 6678 events. 293/6678 cut-off events. For 268/801 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 60750 event pairs, 86 based on Foata normal form. 7/5905 useless extension candidates. Maximal degree in co-relation 7165. Up to 213 conditions per place. [2025-01-09 21:30:44,944 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 17 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2025-01-09 21:30:44,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 562 transitions, 1660 flow [2025-01-09 21:30:44,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-01-09 21:30:44,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-01-09 21:30:44,947 INFO L175 Difference]: Start difference. First operand has 557 places, 561 transitions, 1618 flow. Second operand 3 states and 1641 transitions. [2025-01-09 21:30:44,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 562 transitions, 1660 flow [2025-01-09 21:30:44,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 562 transitions, 1582 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-01-09 21:30:44,959 INFO L231 Difference]: Finished difference. Result has 550 places, 560 transitions, 1542 flow [2025-01-09 21:30:44,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1542, PETRI_PLACES=550, PETRI_TRANSITIONS=560} [2025-01-09 21:30:44,960 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 15 predicate places. [2025-01-09 21:30:44,961 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 560 transitions, 1542 flow [2025-01-09 21:30:44,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:44,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:44,962 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:44,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:30:44,962 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:44,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash 872538135, now seen corresponding path program 2 times [2025-01-09 21:30:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:44,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859082056] [2025-01-09 21:30:44,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:30:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:45,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-01-09 21:30:45,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 402 statements. [2025-01-09 21:30:45,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:30:45,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:45,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:45,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859082056] [2025-01-09 21:30:45,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859082056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:45,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:45,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:45,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037593855] [2025-01-09 21:30:45,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:45,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:45,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:45,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:45,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-01-09 21:30:45,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 560 transitions, 1542 flow. Second operand has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:45,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:45,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-01-09 21:30:45,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,761 INFO L124 PetriNetUnfolderBase]: 153/3886 cut-off events. [2025-01-09 21:30:46,761 INFO L125 PetriNetUnfolderBase]: For 197/435 co-relation queries the response was YES. [2025-01-09 21:30:46,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4634 conditions, 3886 events. 153/3886 cut-off events. For 197/435 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 27287 event pairs, 17 based on Foata normal form. 16/3506 useless extension candidates. Maximal degree in co-relation 4389. Up to 139 conditions per place. [2025-01-09 21:30:46,803 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 30 selfloop transitions, 6 changer transitions 0/567 dead transitions. [2025-01-09 21:30:46,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 567 transitions, 1636 flow [2025-01-09 21:30:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3210 transitions. [2025-01-09 21:30:46,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320557491289199 [2025-01-09 21:30:46,806 INFO L175 Difference]: Start difference. First operand has 550 places, 560 transitions, 1542 flow. Second operand 6 states and 3210 transitions. [2025-01-09 21:30:46,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 567 transitions, 1636 flow [2025-01-09 21:30:46,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 567 transitions, 1632 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:46,814 INFO L231 Difference]: Finished difference. Result has 552 places, 559 transitions, 1548 flow [2025-01-09 21:30:46,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1548, PETRI_PLACES=552, PETRI_TRANSITIONS=559} [2025-01-09 21:30:46,815 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 17 predicate places. [2025-01-09 21:30:46,815 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 559 transitions, 1548 flow [2025-01-09 21:30:46,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:46,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,816 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:46,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:30:46,816 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:46,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash -60535579, now seen corresponding path program 1 times [2025-01-09 21:30:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289701310] [2025-01-09 21:30:46,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-01-09 21:30:46,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-01-09 21:30:46,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289701310] [2025-01-09 21:30:46,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289701310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896949949] [2025-01-09 21:30:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-01-09 21:30:46,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 559 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 541.0) internal successors, (1623), 3 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:46,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-01-09 21:30:46,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:48,313 INFO L124 PetriNetUnfolderBase]: 344/6028 cut-off events. [2025-01-09 21:30:48,314 INFO L125 PetriNetUnfolderBase]: For 319/360 co-relation queries the response was YES. [2025-01-09 21:30:48,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7073 conditions, 6028 events. 344/6028 cut-off events. For 319/360 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 54586 event pairs, 84 based on Foata normal form. 24/5339 useless extension candidates. Maximal degree in co-relation 6560. Up to 316 conditions per place. [2025-01-09 21:30:48,413 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 13 selfloop transitions, 4 changer transitions 12/561 dead transitions. [2025-01-09 21:30:48,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 561 transitions, 1592 flow [2025-01-09 21:30:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-01-09 21:30:48,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-01-09 21:30:48,415 INFO L175 Difference]: Start difference. First operand has 552 places, 559 transitions, 1548 flow. Second operand 3 states and 1639 transitions. [2025-01-09 21:30:48,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 561 transitions, 1592 flow [2025-01-09 21:30:48,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 561 transitions, 1580 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:48,422 INFO L231 Difference]: Finished difference. Result has 548 places, 547 transitions, 1529 flow [2025-01-09 21:30:48,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=548, PETRI_TRANSITIONS=547} [2025-01-09 21:30:48,423 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 13 predicate places. [2025-01-09 21:30:48,423 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 547 transitions, 1529 flow [2025-01-09 21:30:48,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 541.0) internal successors, (1623), 3 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:48,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:48,424 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:48,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:30:48,424 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:48,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1787176365, now seen corresponding path program 1 times [2025-01-09 21:30:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:48,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98368347] [2025-01-09 21:30:48,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:48,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-01-09 21:30:48,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-01-09 21:30:48,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:48,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-01-09 21:30:49,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:49,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98368347] [2025-01-09 21:30:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98368347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:49,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:49,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91667805] [2025-01-09 21:30:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:49,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:49,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:49,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:49,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-01-09 21:30:49,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 547 transitions, 1529 flow. Second operand has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:49,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:49,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-01-09 21:30:49,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:50,694 INFO L124 PetriNetUnfolderBase]: 160/4421 cut-off events. [2025-01-09 21:30:50,695 INFO L125 PetriNetUnfolderBase]: For 223/260 co-relation queries the response was YES. [2025-01-09 21:30:50,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 4421 events. 160/4421 cut-off events. For 223/260 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 32616 event pairs, 22 based on Foata normal form. 8/4058 useless extension candidates. Maximal degree in co-relation 5392. Up to 126 conditions per place. [2025-01-09 21:30:50,744 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-01-09 21:30:50,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 554 transitions, 1621 flow [2025-01-09 21:30:50,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-01-09 21:30:50,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-01-09 21:30:50,747 INFO L175 Difference]: Start difference. First operand has 548 places, 547 transitions, 1529 flow. Second operand 6 states and 3209 transitions. [2025-01-09 21:30:50,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 554 transitions, 1621 flow [2025-01-09 21:30:50,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 554 transitions, 1613 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:50,757 INFO L231 Difference]: Finished difference. Result has 539 places, 546 transitions, 1531 flow [2025-01-09 21:30:50,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=539, PETRI_TRANSITIONS=546} [2025-01-09 21:30:50,758 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-01-09 21:30:50,758 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 546 transitions, 1531 flow [2025-01-09 21:30:50,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:50,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:50,760 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:50,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:30:50,760 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:50,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:50,762 INFO L85 PathProgramCache]: Analyzing trace with hash 990571162, now seen corresponding path program 1 times [2025-01-09 21:30:50,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:50,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021739401] [2025-01-09 21:30:50,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:50,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-01-09 21:30:50,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-01-09 21:30:50,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:50,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:50,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:50,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021739401] [2025-01-09 21:30:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021739401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:50,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:50,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939195364] [2025-01-09 21:30:50,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:50,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:50,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:50,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:50,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:50,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-01-09 21:30:50,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 546 transitions, 1531 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:50,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:50,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-01-09 21:30:50,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:53,420 INFO L124 PetriNetUnfolderBase]: 480/10385 cut-off events. [2025-01-09 21:30:53,420 INFO L125 PetriNetUnfolderBase]: For 298/315 co-relation queries the response was YES. [2025-01-09 21:30:53,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12050 conditions, 10385 events. 480/10385 cut-off events. For 298/315 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 106644 event pairs, 141 based on Foata normal form. 1/9408 useless extension candidates. Maximal degree in co-relation 11536. Up to 573 conditions per place. [2025-01-09 21:30:53,532 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2025-01-09 21:30:53,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 549 transitions, 1570 flow [2025-01-09 21:30:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-01-09 21:30:53,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-01-09 21:30:53,535 INFO L175 Difference]: Start difference. First operand has 539 places, 546 transitions, 1531 flow. Second operand 3 states and 1649 transitions. [2025-01-09 21:30:53,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 549 transitions, 1570 flow [2025-01-09 21:30:53,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 549 transitions, 1558 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:53,546 INFO L231 Difference]: Finished difference. Result has 535 places, 546 transitions, 1529 flow [2025-01-09 21:30:53,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=535, PETRI_TRANSITIONS=546} [2025-01-09 21:30:53,548 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 0 predicate places. [2025-01-09 21:30:53,548 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 546 transitions, 1529 flow [2025-01-09 21:30:53,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:53,549 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:53,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:30:53,549 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:53,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash 501934137, now seen corresponding path program 1 times [2025-01-09 21:30:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:53,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213450196] [2025-01-09 21:30:53,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:53,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-01-09 21:30:53,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-01-09 21:30:53,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:53,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:53,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213450196] [2025-01-09 21:30:53,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213450196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:53,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:53,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:30:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308984450] [2025-01-09 21:30:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:53,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:30:53,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:53,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:30:53,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:30:53,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-01-09 21:30:53,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 546 transitions, 1529 flow. Second operand has 4 states, 4 states have (on average 544.75) internal successors, (2179), 4 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:53,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-01-09 21:30:53,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:56,033 INFO L124 PetriNetUnfolderBase]: 464/8938 cut-off events. [2025-01-09 21:30:56,033 INFO L125 PetriNetUnfolderBase]: For 450/487 co-relation queries the response was YES. [2025-01-09 21:30:56,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10867 conditions, 8938 events. 464/8938 cut-off events. For 450/487 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 94086 event pairs, 188 based on Foata normal form. 0/7998 useless extension candidates. Maximal degree in co-relation 10353. Up to 519 conditions per place. [2025-01-09 21:30:56,163 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 20 selfloop transitions, 4 changer transitions 0/556 dead transitions. [2025-01-09 21:30:56,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 556 transitions, 1601 flow [2025-01-09 21:30:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2740 transitions. [2025-01-09 21:30:56,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547038327526133 [2025-01-09 21:30:56,167 INFO L175 Difference]: Start difference. First operand has 535 places, 546 transitions, 1529 flow. Second operand 5 states and 2740 transitions. [2025-01-09 21:30:56,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 556 transitions, 1601 flow [2025-01-09 21:30:56,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 556 transitions, 1601 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:56,179 INFO L231 Difference]: Finished difference. Result has 542 places, 548 transitions, 1554 flow [2025-01-09 21:30:56,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=548} [2025-01-09 21:30:56,180 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 7 predicate places. [2025-01-09 21:30:56,180 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 548 transitions, 1554 flow [2025-01-09 21:30:56,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.75) internal successors, (2179), 4 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:56,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:56,181 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:56,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:30:56,181 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:56,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1232602850, now seen corresponding path program 1 times [2025-01-09 21:30:56,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:56,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083300084] [2025-01-09 21:30:56,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:56,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:56,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-09 21:30:56,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-09 21:30:56,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:56,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:57,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083300084] [2025-01-09 21:30:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083300084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:57,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:57,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649055534] [2025-01-09 21:30:57,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:57,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:57,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:57,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:57,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-01-09 21:30:57,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 548 transitions, 1554 flow. Second operand has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:57,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:57,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-01-09 21:30:57,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:59,438 INFO L124 PetriNetUnfolderBase]: 462/8687 cut-off events. [2025-01-09 21:30:59,438 INFO L125 PetriNetUnfolderBase]: For 706/757 co-relation queries the response was YES. [2025-01-09 21:30:59,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11117 conditions, 8687 events. 462/8687 cut-off events. For 706/757 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 91148 event pairs, 78 based on Foata normal form. 0/7980 useless extension candidates. Maximal degree in co-relation 10538. Up to 282 conditions per place. [2025-01-09 21:30:59,597 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/555 dead transitions. [2025-01-09 21:30:59,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 555 transitions, 1646 flow [2025-01-09 21:30:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-01-09 21:30:59,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-01-09 21:30:59,600 INFO L175 Difference]: Start difference. First operand has 542 places, 548 transitions, 1554 flow. Second operand 6 states and 3209 transitions. [2025-01-09 21:30:59,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 555 transitions, 1646 flow [2025-01-09 21:30:59,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 555 transitions, 1646 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:59,612 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1564 flow [2025-01-09 21:30:59,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1564, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2025-01-09 21:30:59,614 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 11 predicate places. [2025-01-09 21:30:59,614 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1564 flow [2025-01-09 21:30:59,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:59,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:59,615 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:59,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:30:59,615 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:30:59,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1337602852, now seen corresponding path program 1 times [2025-01-09 21:30:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:59,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965225200] [2025-01-09 21:30:59,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:59,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-09 21:30:59,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-09 21:30:59,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:59,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:30:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965225200] [2025-01-09 21:30:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965225200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:59,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:59,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266352414] [2025-01-09 21:30:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:59,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:59,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:59,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:59,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-01-09 21:30:59,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1564 flow. Second operand has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:59,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:59,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-01-09 21:30:59,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:01,708 INFO L124 PetriNetUnfolderBase]: 676/8755 cut-off events. [2025-01-09 21:31:01,708 INFO L125 PetriNetUnfolderBase]: For 1131/1172 co-relation queries the response was YES. [2025-01-09 21:31:01,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11996 conditions, 8755 events. 676/8755 cut-off events. For 1131/1172 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 94003 event pairs, 366 based on Foata normal form. 0/8004 useless extension candidates. Maximal degree in co-relation 11478. Up to 936 conditions per place. [2025-01-09 21:31:01,827 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 2 changer transitions 1/548 dead transitions. [2025-01-09 21:31:01,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 548 transitions, 1602 flow [2025-01-09 21:31:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-01-09 21:31:01,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-01-09 21:31:01,829 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1564 flow. Second operand 3 states and 1639 transitions. [2025-01-09 21:31:01,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 548 transitions, 1602 flow [2025-01-09 21:31:01,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 548 transitions, 1590 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:31:01,840 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1554 flow [2025-01-09 21:31:01,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2025-01-09 21:31:01,840 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 7 predicate places. [2025-01-09 21:31:01,840 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1554 flow [2025-01-09 21:31:01,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:01,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:01,841 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:01,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:31:01,841 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:31:01,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2046711458, now seen corresponding path program 1 times [2025-01-09 21:31:01,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:01,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640326994] [2025-01-09 21:31:01,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:01,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:01,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-01-09 21:31:01,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-01-09 21:31:01,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:01,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:31:02,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:02,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640326994] [2025-01-09 21:31:02,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640326994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:02,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:02,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:31:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48820578] [2025-01-09 21:31:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:02,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:31:02,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:02,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:31:02,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:31:02,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-01-09 21:31:02,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1554 flow. Second operand has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:02,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:02,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-01-09 21:31:02,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:04,242 INFO L124 PetriNetUnfolderBase]: 216/6466 cut-off events. [2025-01-09 21:31:04,243 INFO L125 PetriNetUnfolderBase]: For 345/427 co-relation queries the response was YES. [2025-01-09 21:31:04,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 6466 events. 216/6466 cut-off events. For 345/427 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 55433 event pairs, 39 based on Foata normal form. 2/6077 useless extension candidates. Maximal degree in co-relation 7905. Up to 152 conditions per place. [2025-01-09 21:31:04,378 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/553 dead transitions. [2025-01-09 21:31:04,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 553 transitions, 1646 flow [2025-01-09 21:31:04,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:31:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:31:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-01-09 21:31:04,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-01-09 21:31:04,380 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1554 flow. Second operand 6 states and 3209 transitions. [2025-01-09 21:31:04,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 553 transitions, 1646 flow [2025-01-09 21:31:04,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 553 transitions, 1642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:04,392 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1560 flow [2025-01-09 21:31:04,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1560, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2025-01-09 21:31:04,393 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 9 predicate places. [2025-01-09 21:31:04,393 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1560 flow [2025-01-09 21:31:04,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:04,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:04,394 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:04,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:31:04,394 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:31:04,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1458065691, now seen corresponding path program 1 times [2025-01-09 21:31:04,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:04,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660685988] [2025-01-09 21:31:04,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:04,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:04,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-01-09 21:31:04,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-01-09 21:31:04,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:04,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:31:05,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:05,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660685988] [2025-01-09 21:31:05,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660685988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:05,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:05,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:31:05,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154835024] [2025-01-09 21:31:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:05,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:31:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:05,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:31:05,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:31:05,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-01-09 21:31:05,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1560 flow. Second operand has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:05,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:05,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-01-09 21:31:05,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:07,149 INFO L124 PetriNetUnfolderBase]: 512/8653 cut-off events. [2025-01-09 21:31:07,149 INFO L125 PetriNetUnfolderBase]: For 775/816 co-relation queries the response was YES. [2025-01-09 21:31:07,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11257 conditions, 8653 events. 512/8653 cut-off events. For 775/816 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 90020 event pairs, 76 based on Foata normal form. 8/8123 useless extension candidates. Maximal degree in co-relation 10678. Up to 320 conditions per place. [2025-01-09 21:31:07,286 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/552 dead transitions. [2025-01-09 21:31:07,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 552 transitions, 1652 flow [2025-01-09 21:31:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:31:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:31:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-01-09 21:31:07,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-01-09 21:31:07,288 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1560 flow. Second operand 6 states and 3209 transitions. [2025-01-09 21:31:07,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 552 transitions, 1652 flow [2025-01-09 21:31:07,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 552 transitions, 1640 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:31:07,298 INFO L231 Difference]: Finished difference. Result has 543 places, 544 transitions, 1558 flow [2025-01-09 21:31:07,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=543, PETRI_TRANSITIONS=544} [2025-01-09 21:31:07,298 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 8 predicate places. [2025-01-09 21:31:07,299 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 544 transitions, 1558 flow [2025-01-09 21:31:07,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:07,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:07,299 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:07,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:31:07,300 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:31:07,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1971957117, now seen corresponding path program 1 times [2025-01-09 21:31:07,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:07,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085507166] [2025-01-09 21:31:07,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:07,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 21:31:07,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 21:31:07,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:07,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2025-01-09 21:31:07,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:07,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085507166] [2025-01-09 21:31:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085507166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:07,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:07,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:07,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828520040] [2025-01-09 21:31:07,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:07,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:07,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:07,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:07,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:07,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-01-09 21:31:07,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 544 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:07,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:07,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-01-09 21:31:07,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:09,132 INFO L124 PetriNetUnfolderBase]: 226/7968 cut-off events. [2025-01-09 21:31:09,132 INFO L125 PetriNetUnfolderBase]: For 376/602 co-relation queries the response was YES. [2025-01-09 21:31:09,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10222 conditions, 7968 events. 226/7968 cut-off events. For 376/602 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 73789 event pairs, 84 based on Foata normal form. 10/7639 useless extension candidates. Maximal degree in co-relation 10060. Up to 301 conditions per place. [2025-01-09 21:31:09,255 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2025-01-09 21:31:09,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 545 transitions, 1596 flow [2025-01-09 21:31:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-01-09 21:31:09,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-01-09 21:31:09,256 INFO L175 Difference]: Start difference. First operand has 543 places, 544 transitions, 1558 flow. Second operand 3 states and 1639 transitions. [2025-01-09 21:31:09,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 545 transitions, 1596 flow [2025-01-09 21:31:09,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 545 transitions, 1584 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:31:09,265 INFO L231 Difference]: Finished difference. Result has 539 places, 543 transitions, 1550 flow [2025-01-09 21:31:09,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1550, PETRI_PLACES=539, PETRI_TRANSITIONS=543} [2025-01-09 21:31:09,266 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-01-09 21:31:09,266 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 543 transitions, 1550 flow [2025-01-09 21:31:09,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:09,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:09,267 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:09,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:31:09,267 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:31:09,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1337892174, now seen corresponding path program 1 times [2025-01-09 21:31:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:09,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618891139] [2025-01-09 21:31:09,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:09,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 21:31:09,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 21:31:09,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:09,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:31:09,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:09,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618891139] [2025-01-09 21:31:09,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618891139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:09,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:09,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:09,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39864601] [2025-01-09 21:31:09,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:09,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:09,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:09,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:09,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-01-09 21:31:09,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 543 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:09,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:09,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-01-09 21:31:09,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:11,396 INFO L124 PetriNetUnfolderBase]: 325/8405 cut-off events. [2025-01-09 21:31:11,396 INFO L125 PetriNetUnfolderBase]: For 458/595 co-relation queries the response was YES. [2025-01-09 21:31:11,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10474 conditions, 8405 events. 325/8405 cut-off events. For 458/595 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 80730 event pairs, 166 based on Foata normal form. 0/7984 useless extension candidates. Maximal degree in co-relation 9956. Up to 367 conditions per place. [2025-01-09 21:31:11,507 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2025-01-09 21:31:11,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 544 transitions, 1588 flow [2025-01-09 21:31:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-01-09 21:31:11,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-01-09 21:31:11,509 INFO L175 Difference]: Start difference. First operand has 539 places, 543 transitions, 1550 flow. Second operand 3 states and 1639 transitions. [2025-01-09 21:31:11,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 544 transitions, 1588 flow [2025-01-09 21:31:11,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 544 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:11,516 INFO L231 Difference]: Finished difference. Result has 538 places, 542 transitions, 1548 flow [2025-01-09 21:31:11,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=538, PETRI_TRANSITIONS=542} [2025-01-09 21:31:11,517 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 3 predicate places. [2025-01-09 21:31:11,517 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 542 transitions, 1548 flow [2025-01-09 21:31:11,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:11,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:11,518 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:11,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:31:11,518 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-01-09 21:31:11,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1212338037, now seen corresponding path program 1 times [2025-01-09 21:31:11,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:11,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532117561] [2025-01-09 21:31:11,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:11,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:11,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-09 21:31:11,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-09 21:31:11,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:11,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 21:31:11,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:11,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532117561] [2025-01-09 21:31:11,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532117561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:11,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:11,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600455824] [2025-01-09 21:31:11,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:11,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:11,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:11,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:11,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:11,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-01-09 21:31:11,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 542 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:11,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:11,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-01-09 21:31:11,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:13,745 INFO L124 PetriNetUnfolderBase]: 620/8668 cut-off events. [2025-01-09 21:31:13,745 INFO L125 PetriNetUnfolderBase]: For 886/915 co-relation queries the response was YES. [2025-01-09 21:31:13,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11419 conditions, 8668 events. 620/8668 cut-off events. For 886/915 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 92854 event pairs, 344 based on Foata normal form. 0/8155 useless extension candidates. Maximal degree in co-relation 10901. Up to 890 conditions per place. [2025-01-09 21:31:13,815 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 0 selfloop transitions, 0 changer transitions 543/543 dead transitions. [2025-01-09 21:31:13,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 543 transitions, 1586 flow [2025-01-09 21:31:13,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-01-09 21:31:13,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-01-09 21:31:13,817 INFO L175 Difference]: Start difference. First operand has 538 places, 542 transitions, 1548 flow. Second operand 3 states and 1639 transitions. [2025-01-09 21:31:13,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 543 transitions, 1586 flow [2025-01-09 21:31:13,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 543 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:13,824 INFO L231 Difference]: Finished difference. Result has 537 places, 0 transitions, 0 flow [2025-01-09 21:31:13,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=537, PETRI_TRANSITIONS=0} [2025-01-09 21:31:13,825 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 2 predicate places. [2025-01-09 21:31:13,825 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 0 transitions, 0 flow [2025-01-09 21:31:13,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:13,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (80 of 81 remaining) [2025-01-09 21:31:13,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (79 of 81 remaining) [2025-01-09 21:31:13,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (78 of 81 remaining) [2025-01-09 21:31:13,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (77 of 81 remaining) [2025-01-09 21:31:13,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (76 of 81 remaining) [2025-01-09 21:31:13,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (75 of 81 remaining) [2025-01-09 21:31:13,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (69 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (68 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (67 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (66 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (65 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (64 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (63 of 81 remaining) [2025-01-09 21:31:13,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 81 remaining) [2025-01-09 21:31:13,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 81 remaining) [2025-01-09 21:31:13,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 81 remaining) [2025-01-09 21:31:13,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 81 remaining) [2025-01-09 21:31:13,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (58 of 81 remaining) [2025-01-09 21:31:13,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (57 of 81 remaining) [2025-01-09 21:31:13,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (56 of 81 remaining) [2025-01-09 21:31:13,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (55 of 81 remaining) [2025-01-09 21:31:13,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (54 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (53 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (52 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (51 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (50 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (49 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (48 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (47 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (45 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (43 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (41 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (40 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (39 of 81 remaining) [2025-01-09 21:31:13,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (38 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (31 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (28 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (27 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (17 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (16 of 81 remaining) [2025-01-09 21:31:13,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (15 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (12 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (7 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (2 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (1 of 81 remaining) [2025-01-09 21:31:13,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (0 of 81 remaining) [2025-01-09 21:31:13,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:31:13,834 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 21:31:13,842 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:31:13,842 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:31:13,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:31:13 BasicIcfg [2025-01-09 21:31:13,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:31:13,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:31:13,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:31:13,854 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:31:13,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:19" (3/4) ... [2025-01-09 21:31:13,856 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:31:13,860 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:31:13,860 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:31:13,861 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:31:13,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-01-09 21:31:13,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:31:13,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:31:13,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:31:13,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:31:13,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:31:13,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:31:13,972 INFO L158 Benchmark]: Toolchain (without parser) took 55395.97ms. Allocated memory was 167.8MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 125.8MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 478.7MB. Max. memory is 16.1GB. [2025-01-09 21:31:13,973 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:13,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.52ms. Allocated memory is still 167.8MB. Free memory was 125.8MB in the beginning and 112.0MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:13,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.35ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 109.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:13,974 INFO L158 Benchmark]: Boogie Preprocessor took 64.59ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 106.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:13,975 INFO L158 Benchmark]: RCFGBuilder took 878.75ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 66.5MB in the end (delta: 40.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 21:31:13,975 INFO L158 Benchmark]: TraceAbstraction took 53948.41ms. Allocated memory was 167.8MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 65.6MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-01-09 21:31:13,976 INFO L158 Benchmark]: Witness Printer took 117.60ms. Allocated memory is still 2.9GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:13,977 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.52ms. Allocated memory is still 167.8MB. Free memory was 125.8MB in the beginning and 112.0MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.35ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 109.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.59ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 106.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 878.75ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 66.5MB in the end (delta: 40.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 53948.41ms. Allocated memory was 167.8MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 65.6MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 117.60ms. Allocated memory is still 2.9GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 848 locations, 81 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.7s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 43.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4021 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2641 mSDsluCounter, 1740 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1350 mSDsCounter, 728 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6583 IncrementalHoareTripleChecker+Invalid, 7311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 728 mSolverCounterUnsat, 390 mSDtfsCounter, 6583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 1078 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1618occurred in iteration=24, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 10413 NumberOfCodeBlocks, 10053 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10900 ConstructedInterpolants, 0 QuantifiedInterpolants, 12962 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 7212/7359 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:31:13,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE