./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-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-simpl-str-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 f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:31:21,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:31:21,765 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:31:21,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:31:21,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:31:21,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:31:21,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:31:21,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:31:21,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:31:21,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:31:21,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:31:21,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:31:21,783 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:31:21,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:31:21,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:31:21,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:31:21,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:31:21,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:31:21,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:31:21,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:31:21,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:21,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:21,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:31:21,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:31:21,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:31:21,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:31:21,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:31:21,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:31:21,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:31:21,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:31:21,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:31:21,788 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 -> f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 [2025-01-09 21:31:21,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:31:21,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:31:21,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:31:21,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:31:21,998 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:31:21,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2025-01-09 21:31:23,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d6a801b6/0fdd859f3a744253ae28c3737b70bc78/FLAGdd1bebfa9 [2025-01-09 21:31:23,420 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:31:23,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2025-01-09 21:31:23,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d6a801b6/0fdd859f3a744253ae28c3737b70bc78/FLAGdd1bebfa9 [2025-01-09 21:31:23,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d6a801b6/0fdd859f3a744253ae28c3737b70bc78 [2025-01-09 21:31:23,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:31:23,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:31:23,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:31:23,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:31:23,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:31:23,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79dfd16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23, skipping insertion in model container [2025-01-09 21:31:23,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:31:23,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:31:23,717 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:31:23,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:31:23,750 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:31:23,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23 WrapperNode [2025-01-09 21:31:23,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:31:23,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:31:23,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:31:23,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:31:23,757 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:31:23" (1/1) ... [2025-01-09 21:31:23,763 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:31:23" (1/1) ... [2025-01-09 21:31:23,783 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 235 [2025-01-09 21:31:23,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:31:23,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:31:23,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:31:23,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:31:23,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:31:23,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:31:23,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:31:23,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:31:23,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (1/1) ... [2025-01-09 21:31:23,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:23,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:31:23,845 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:31:23,855 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:31:23,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:31:23,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:31:23,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:31:23,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:31:23,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:31:23,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:31:23,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:31:23,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:31:23,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:31:23,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:31:23,873 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:31:23,937 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:31:23,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:31:24,146 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:31:24,146 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:31:24,156 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:31:24,156 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:31:24,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:24 BoogieIcfgContainer [2025-01-09 21:31:24,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:31:24,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:31:24,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:31:24,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:31:24,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:31:23" (1/3) ... [2025-01-09 21:31:24,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cae931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:31:24, skipping insertion in model container [2025-01-09 21:31:24,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:23" (2/3) ... [2025-01-09 21:31:24,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cae931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:31:24, skipping insertion in model container [2025-01-09 21:31:24,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:24" (3/3) ... [2025-01-09 21:31:24,162 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2025-01-09 21:31:24,171 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:31:24,172 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-trans.wvr.c that has 4 procedures, 302 locations, 1 initial locations, 0 loop locations, and 27 error locations. [2025-01-09 21:31:24,172 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:31:24,240 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:31:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 316 transitions, 653 flow [2025-01-09 21:31:24,334 INFO L124 PetriNetUnfolderBase]: 15/313 cut-off events. [2025-01-09 21:31:24,336 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:31:24,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 313 events. 15/313 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 739 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2025-01-09 21:31:24,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 316 transitions, 653 flow [2025-01-09 21:31:24,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 292 transitions, 602 flow [2025-01-09 21:31:24,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:31:24,366 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;@2da1134a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:31:24,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-01-09 21:31:24,376 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:31:24,376 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:31:24,376 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:31:24,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:24,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] [2025-01-09 21:31:24,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:24,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash -67802981, now seen corresponding path program 1 times [2025-01-09 21:31:24,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:24,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670056585] [2025-01-09 21:31:24,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:24,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:31:24,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:31:24,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:24,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:24,525 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:31:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670056585] [2025-01-09 21:31:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670056585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:24,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:24,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:24,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342850422] [2025-01-09 21:31:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:24,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:24,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:24,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:24,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-01-09 21:31:24,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 292 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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:24,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:24,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-01-09 21:31:24,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:24,717 INFO L124 PetriNetUnfolderBase]: 18/466 cut-off events. [2025-01-09 21:31:24,717 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:31:24,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 466 events. 18/466 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2026 event pairs, 5 based on Foata normal form. 18/414 useless extension candidates. Maximal degree in co-relation 386. Up to 22 conditions per place. [2025-01-09 21:31:24,730 INFO L140 encePairwiseOnDemand]: 307/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-01-09 21:31:24,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 285 transitions, 614 flow [2025-01-09 21:31:24,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2025-01-09 21:31:24,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483122362869199 [2025-01-09 21:31:24,755 INFO L175 Difference]: Start difference. First operand has 289 places, 292 transitions, 602 flow. Second operand 3 states and 899 transitions. [2025-01-09 21:31:24,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 285 transitions, 614 flow [2025-01-09 21:31:24,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 285 transitions, 602 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:31:24,763 INFO L231 Difference]: Finished difference. Result has 284 places, 285 transitions, 580 flow [2025-01-09 21:31:24,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=284, PETRI_TRANSITIONS=285} [2025-01-09 21:31:24,767 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -5 predicate places. [2025-01-09 21:31:24,768 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 285 transitions, 580 flow [2025-01-09 21:31:24,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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:24,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:24,768 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] [2025-01-09 21:31:24,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:31:24,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:24,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1671178864, now seen corresponding path program 1 times [2025-01-09 21:31:24,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:24,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946610816] [2025-01-09 21:31:24,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:24,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:24,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:31:24,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:31:24,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:24,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:24,802 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:31:24,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:24,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946610816] [2025-01-09 21:31:24,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946610816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:24,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:24,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:24,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78425281] [2025-01-09 21:31:24,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:24,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:24,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:24,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:24,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:24,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-01-09 21:31:24,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 285 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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:24,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:24,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-01-09 21:31:24,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:24,870 INFO L124 PetriNetUnfolderBase]: 16/418 cut-off events. [2025-01-09 21:31:24,870 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:31:24,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 418 events. 16/418 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1709 event pairs, 5 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 417. Up to 22 conditions per place. [2025-01-09 21:31:24,874 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-01-09 21:31:24,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 284 transitions, 604 flow [2025-01-09 21:31:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-01-09 21:31:24,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419831223628692 [2025-01-09 21:31:24,876 INFO L175 Difference]: Start difference. First operand has 284 places, 285 transitions, 580 flow. Second operand 3 states and 893 transitions. [2025-01-09 21:31:24,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 284 transitions, 604 flow [2025-01-09 21:31:24,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 284 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:24,880 INFO L231 Difference]: Finished difference. Result has 283 places, 284 transitions, 578 flow [2025-01-09 21:31:24,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=283, PETRI_TRANSITIONS=284} [2025-01-09 21:31:24,881 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -6 predicate places. [2025-01-09 21:31:24,881 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 284 transitions, 578 flow [2025-01-09 21:31:24,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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:24,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:24,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:24,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:31:24,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:24,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash 208543711, now seen corresponding path program 1 times [2025-01-09 21:31:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:24,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22471683] [2025-01-09 21:31:24,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:24,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:24,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:31:24,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:31:24,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:24,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:24,911 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:31:24,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:24,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22471683] [2025-01-09 21:31:24,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22471683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:24,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:24,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:24,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741130200] [2025-01-09 21:31:24,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:24,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:24,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:24,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:24,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:24,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 316 [2025-01-09 21:31:24,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 284 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:24,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:24,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 316 [2025-01-09 21:31:24,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:25,027 INFO L124 PetriNetUnfolderBase]: 33/686 cut-off events. [2025-01-09 21:31:25,027 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:31:25,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 686 events. 33/686 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3699 event pairs, 12 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 695. Up to 35 conditions per place. [2025-01-09 21:31:25,032 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 12 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-01-09 21:31:25,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 283 transitions, 604 flow [2025-01-09 21:31:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-01-09 21:31:25,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939873417721519 [2025-01-09 21:31:25,034 INFO L175 Difference]: Start difference. First operand has 283 places, 284 transitions, 578 flow. Second operand 3 states and 891 transitions. [2025-01-09 21:31:25,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 283 transitions, 604 flow [2025-01-09 21:31:25,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 283 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:25,037 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 576 flow [2025-01-09 21:31:25,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2025-01-09 21:31:25,038 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -7 predicate places. [2025-01-09 21:31:25,038 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 576 flow [2025-01-09 21:31:25,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:25,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:25,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:31:25,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:31:25,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:25,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:25,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1053107671, now seen corresponding path program 1 times [2025-01-09 21:31:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:25,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702742382] [2025-01-09 21:31:25,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:25,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:25,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:31:25,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:31:25,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:25,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:25,070 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:31:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:25,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702742382] [2025-01-09 21:31:25,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702742382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:25,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:25,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:25,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118176900] [2025-01-09 21:31:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:25,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:25,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:25,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:25,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:25,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-01-09 21:31:25,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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:25,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:25,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-01-09 21:31:25,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:25,170 INFO L124 PetriNetUnfolderBase]: 22/541 cut-off events. [2025-01-09 21:31:25,171 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-01-09 21:31:25,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 541 events. 22/541 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2512 event pairs, 7 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 529. Up to 25 conditions per place. [2025-01-09 21:31:25,177 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-01-09 21:31:25,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 282 transitions, 600 flow [2025-01-09 21:31:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-01-09 21:31:25,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419831223628692 [2025-01-09 21:31:25,180 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 576 flow. Second operand 3 states and 893 transitions. [2025-01-09 21:31:25,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 282 transitions, 600 flow [2025-01-09 21:31:25,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 282 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:25,185 INFO L231 Difference]: Finished difference. Result has 281 places, 282 transitions, 574 flow [2025-01-09 21:31:25,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=281, PETRI_TRANSITIONS=282} [2025-01-09 21:31:25,185 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -8 predicate places. [2025-01-09 21:31:25,186 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 282 transitions, 574 flow [2025-01-09 21:31:25,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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:25,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:25,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:25,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:31:25,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:25,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1357901507, now seen corresponding path program 1 times [2025-01-09 21:31:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:25,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798464519] [2025-01-09 21:31:25,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:25,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:31:25,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:31:25,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:25,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:25,235 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:31:25,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:25,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798464519] [2025-01-09 21:31:25,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798464519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:25,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:25,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:25,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600056185] [2025-01-09 21:31:25,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:25,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:25,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:25,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:25,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 316 [2025-01-09 21:31:25,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 282 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:25,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:25,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 316 [2025-01-09 21:31:25,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:25,336 INFO L124 PetriNetUnfolderBase]: 43/725 cut-off events. [2025-01-09 21:31:25,337 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-01-09 21:31:25,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 725 events. 43/725 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3764 event pairs, 20 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 728. Up to 50 conditions per place. [2025-01-09 21:31:25,343 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 13 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-01-09 21:31:25,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 281 transitions, 602 flow [2025-01-09 21:31:25,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 889 transitions. [2025-01-09 21:31:25,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9377637130801688 [2025-01-09 21:31:25,345 INFO L175 Difference]: Start difference. First operand has 281 places, 282 transitions, 574 flow. Second operand 3 states and 889 transitions. [2025-01-09 21:31:25,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 281 transitions, 602 flow [2025-01-09 21:31:25,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 281 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:25,348 INFO L231 Difference]: Finished difference. Result has 280 places, 281 transitions, 572 flow [2025-01-09 21:31:25,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=280, PETRI_TRANSITIONS=281} [2025-01-09 21:31:25,349 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -9 predicate places. [2025-01-09 21:31:25,349 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 281 transitions, 572 flow [2025-01-09 21:31:25,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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:25,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:25,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:25,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:31:25,350 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:25,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1198956156, now seen corresponding path program 1 times [2025-01-09 21:31:25,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:25,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841234854] [2025-01-09 21:31:25,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:25,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:31:25,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:31:25,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:25,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:25,399 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:31:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841234854] [2025-01-09 21:31:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841234854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:25,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980313716] [2025-01-09 21:31:25,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:25,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:25,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:25,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:25,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-01-09 21:31:25,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 281 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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:25,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:25,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-01-09 21:31:25,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:25,468 INFO L124 PetriNetUnfolderBase]: 16/353 cut-off events. [2025-01-09 21:31:25,468 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-01-09 21:31:25,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 353 events. 16/353 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1262 event pairs, 7 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 322. Up to 25 conditions per place. [2025-01-09 21:31:25,471 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-01-09 21:31:25,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 280 transitions, 596 flow [2025-01-09 21:31:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-01-09 21:31:25,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419831223628692 [2025-01-09 21:31:25,473 INFO L175 Difference]: Start difference. First operand has 280 places, 281 transitions, 572 flow. Second operand 3 states and 893 transitions. [2025-01-09 21:31:25,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 280 transitions, 596 flow [2025-01-09 21:31:25,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 280 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:25,476 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 570 flow [2025-01-09 21:31:25,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2025-01-09 21:31:25,477 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-01-09 21:31:25,477 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 570 flow [2025-01-09 21:31:25,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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:25,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:25,478 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] [2025-01-09 21:31:25,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:31:25,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:25,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash -231153523, now seen corresponding path program 1 times [2025-01-09 21:31:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:25,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680872574] [2025-01-09 21:31:25,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:25,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 21:31:25,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 21:31:25,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:25,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:25,509 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:31:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680872574] [2025-01-09 21:31:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680872574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:25,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:25,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872373318] [2025-01-09 21:31:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:25,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:25,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:25,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:25,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-01-09 21:31:25,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 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:25,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:25,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-01-09 21:31:25,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:25,582 INFO L124 PetriNetUnfolderBase]: 33/699 cut-off events. [2025-01-09 21:31:25,582 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:25,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 699 events. 33/699 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3907 event pairs, 8 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 672. Up to 31 conditions per place. [2025-01-09 21:31:25,588 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-01-09 21:31:25,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 282 transitions, 606 flow [2025-01-09 21:31:25,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-01-09 21:31:25,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-01-09 21:31:25,590 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 570 flow. Second operand 3 states and 902 transitions. [2025-01-09 21:31:25,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 282 transitions, 606 flow [2025-01-09 21:31:25,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 282 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:25,594 INFO L231 Difference]: Finished difference. Result has 278 places, 280 transitions, 576 flow [2025-01-09 21:31:25,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=278, PETRI_TRANSITIONS=280} [2025-01-09 21:31:25,594 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-01-09 21:31:25,595 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 280 transitions, 576 flow [2025-01-09 21:31:25,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 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:25,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:25,595 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] [2025-01-09 21:31:25,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:31:25,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:25,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:25,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1461307220, now seen corresponding path program 1 times [2025-01-09 21:31:25,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:25,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540933014] [2025-01-09 21:31:25,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:25,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:25,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:31:25,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:31:25,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:25,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:25,624 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:31:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540933014] [2025-01-09 21:31:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540933014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:25,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:25,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:25,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421336540] [2025-01-09 21:31:25,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:25,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:25,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:25,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:25,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 316 [2025-01-09 21:31:25,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 280 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:25,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:25,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 316 [2025-01-09 21:31:25,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:25,732 INFO L124 PetriNetUnfolderBase]: 70/1041 cut-off events. [2025-01-09 21:31:25,732 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:25,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 1041 events. 70/1041 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7322 event pairs, 10 based on Foata normal form. 0/897 useless extension candidates. Maximal degree in co-relation 1005. Up to 73 conditions per place. [2025-01-09 21:31:25,739 INFO L140 encePairwiseOnDemand]: 310/316 looper letters, 15 selfloop transitions, 3 changer transitions 0/282 dead transitions. [2025-01-09 21:31:25,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 282 transitions, 618 flow [2025-01-09 21:31:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2025-01-09 21:31:25,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9462025316455697 [2025-01-09 21:31:25,741 INFO L175 Difference]: Start difference. First operand has 278 places, 280 transitions, 576 flow. Second operand 3 states and 897 transitions. [2025-01-09 21:31:25,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 282 transitions, 618 flow [2025-01-09 21:31:25,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 282 transitions, 618 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:25,744 INFO L231 Difference]: Finished difference. Result has 278 places, 280 transitions, 591 flow [2025-01-09 21:31:25,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=278, PETRI_TRANSITIONS=280} [2025-01-09 21:31:25,745 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-01-09 21:31:25,745 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 280 transitions, 591 flow [2025-01-09 21:31:25,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:25,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:25,746 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] [2025-01-09 21:31:25,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:31:25,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:25,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash 15464438, now seen corresponding path program 1 times [2025-01-09 21:31:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297489922] [2025-01-09 21:31:25,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:25,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:31:25,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:31:25,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:25,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:25,783 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:31:25,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297489922] [2025-01-09 21:31:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297489922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:25,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:25,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:25,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951954183] [2025-01-09 21:31:25,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:25,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:25,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:25,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:25,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:25,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-01-09 21:31:25,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 280 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 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:25,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:25,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-01-09 21:31:25,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:25,881 INFO L124 PetriNetUnfolderBase]: 31/808 cut-off events. [2025-01-09 21:31:25,882 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-01-09 21:31:25,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 808 events. 31/808 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4380 event pairs, 2 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 723. Up to 38 conditions per place. [2025-01-09 21:31:25,890 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 16 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-01-09 21:31:25,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 285 transitions, 642 flow [2025-01-09 21:31:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-01-09 21:31:25,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9546413502109705 [2025-01-09 21:31:25,892 INFO L175 Difference]: Start difference. First operand has 278 places, 280 transitions, 591 flow. Second operand 3 states and 905 transitions. [2025-01-09 21:31:25,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 285 transitions, 642 flow [2025-01-09 21:31:25,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 285 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:25,895 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 601 flow [2025-01-09 21:31:25,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2025-01-09 21:31:25,896 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-01-09 21:31:25,896 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 601 flow [2025-01-09 21:31:25,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 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:25,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:25,897 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] [2025-01-09 21:31:25,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:31:25,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:25,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:25,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1976446874, now seen corresponding path program 1 times [2025-01-09 21:31:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:25,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932807979] [2025-01-09 21:31:25,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:25,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:31:25,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:31:25,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:25,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:25,924 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:31:25,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932807979] [2025-01-09 21:31:25,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932807979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:25,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:25,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:25,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191338446] [2025-01-09 21:31:25,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:25,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:25,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:25,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:25,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-01-09 21:31:25,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 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:25,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:25,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-01-09 21:31:25,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:26,071 INFO L124 PetriNetUnfolderBase]: 43/1127 cut-off events. [2025-01-09 21:31:26,071 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2025-01-09 21:31:26,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 1127 events. 43/1127 cut-off events. For 9/21 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7426 event pairs, 6 based on Foata normal form. 1/1006 useless extension candidates. Maximal degree in co-relation 1087. Up to 64 conditions per place. [2025-01-09 21:31:26,082 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 16 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-01-09 21:31:26,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 285 transitions, 652 flow [2025-01-09 21:31:26,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-01-09 21:31:26,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9546413502109705 [2025-01-09 21:31:26,085 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 601 flow. Second operand 3 states and 905 transitions. [2025-01-09 21:31:26,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 285 transitions, 652 flow [2025-01-09 21:31:26,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 285 transitions, 652 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:26,088 INFO L231 Difference]: Finished difference. Result has 280 places, 280 transitions, 611 flow [2025-01-09 21:31:26,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=611, PETRI_PLACES=280, PETRI_TRANSITIONS=280} [2025-01-09 21:31:26,089 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -9 predicate places. [2025-01-09 21:31:26,089 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 280 transitions, 611 flow [2025-01-09 21:31:26,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 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:26,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:26,090 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] [2025-01-09 21:31:26,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:31:26,090 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:26,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:26,091 INFO L85 PathProgramCache]: Analyzing trace with hash -713034984, now seen corresponding path program 1 times [2025-01-09 21:31:26,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:26,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027736302] [2025-01-09 21:31:26,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:26,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:31:26,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:31:26,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:26,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:26,136 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:31:26,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:26,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027736302] [2025-01-09 21:31:26,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027736302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:26,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:26,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:26,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552113713] [2025-01-09 21:31:26,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:26,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:26,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:26,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:26,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:26,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 316 [2025-01-09 21:31:26,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 280 transitions, 611 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:26,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:26,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 316 [2025-01-09 21:31:26,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:26,263 INFO L124 PetriNetUnfolderBase]: 38/965 cut-off events. [2025-01-09 21:31:26,263 INFO L125 PetriNetUnfolderBase]: For 6/35 co-relation queries the response was YES. [2025-01-09 21:31:26,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 965 events. 38/965 cut-off events. For 6/35 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5803 event pairs, 8 based on Foata normal form. 4/859 useless extension candidates. Maximal degree in co-relation 933. Up to 38 conditions per place. [2025-01-09 21:31:26,277 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-01-09 21:31:26,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 281 transitions, 641 flow [2025-01-09 21:31:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-01-09 21:31:26,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-01-09 21:31:26,279 INFO L175 Difference]: Start difference. First operand has 280 places, 280 transitions, 611 flow. Second operand 3 states and 902 transitions. [2025-01-09 21:31:26,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 281 transitions, 641 flow [2025-01-09 21:31:26,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 281 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:26,283 INFO L231 Difference]: Finished difference. Result has 281 places, 279 transitions, 613 flow [2025-01-09 21:31:26,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=281, PETRI_TRANSITIONS=279} [2025-01-09 21:31:26,284 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -8 predicate places. [2025-01-09 21:31:26,284 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 279 transitions, 613 flow [2025-01-09 21:31:26,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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:26,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:26,285 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] [2025-01-09 21:31:26,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:31:26,285 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:26,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1229713910, now seen corresponding path program 1 times [2025-01-09 21:31:26,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109396281] [2025-01-09 21:31:26,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:26,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:26,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:31:26,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:31:26,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:26,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:26,334 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:31:26,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:26,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109396281] [2025-01-09 21:31:26,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109396281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:26,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:26,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:26,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403929080] [2025-01-09 21:31:26,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:26,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:26,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:26,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:26,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:26,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 316 [2025-01-09 21:31:26,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 279 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 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:26,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:26,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 316 [2025-01-09 21:31:26,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:26,723 INFO L124 PetriNetUnfolderBase]: 240/3552 cut-off events. [2025-01-09 21:31:26,723 INFO L125 PetriNetUnfolderBase]: For 69/81 co-relation queries the response was YES. [2025-01-09 21:31:26,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4040 conditions, 3552 events. 240/3552 cut-off events. For 69/81 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 35374 event pairs, 60 based on Foata normal form. 1/3163 useless extension candidates. Maximal degree in co-relation 3454. Up to 331 conditions per place. [2025-01-09 21:31:26,754 INFO L140 encePairwiseOnDemand]: 308/316 looper letters, 17 selfloop transitions, 4 changer transitions 0/281 dead transitions. [2025-01-09 21:31:26,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 281 transitions, 661 flow [2025-01-09 21:31:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-01-09 21:31:26,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9409282700421941 [2025-01-09 21:31:26,756 INFO L175 Difference]: Start difference. First operand has 281 places, 279 transitions, 613 flow. Second operand 3 states and 892 transitions. [2025-01-09 21:31:26,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 281 transitions, 661 flow [2025-01-09 21:31:26,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 281 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:26,760 INFO L231 Difference]: Finished difference. Result has 278 places, 279 transitions, 629 flow [2025-01-09 21:31:26,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=278, PETRI_TRANSITIONS=279} [2025-01-09 21:31:26,761 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-01-09 21:31:26,761 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 279 transitions, 629 flow [2025-01-09 21:31:26,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 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:26,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:26,762 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] [2025-01-09 21:31:26,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:31:26,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:26,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash -559817681, now seen corresponding path program 1 times [2025-01-09 21:31:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:26,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703093326] [2025-01-09 21:31:26,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:26,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:26,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:31:26,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:31:26,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:26,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:26,806 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:31:26,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703093326] [2025-01-09 21:31:26,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703093326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:26,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:26,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:26,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827694952] [2025-01-09 21:31:26,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:26,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:26,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:26,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:26,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:26,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-01-09 21:31:26,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 279 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 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:26,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:26,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-01-09 21:31:26,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:27,031 INFO L124 PetriNetUnfolderBase]: 115/2657 cut-off events. [2025-01-09 21:31:27,031 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2025-01-09 21:31:27,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2959 conditions, 2657 events. 115/2657 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 23788 event pairs, 14 based on Foata normal form. 0/2401 useless extension candidates. Maximal degree in co-relation 2527. Up to 168 conditions per place. [2025-01-09 21:31:27,042 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 15 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-01-09 21:31:27,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 283 transitions, 675 flow [2025-01-09 21:31:27,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2025-01-09 21:31:27,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535864978902954 [2025-01-09 21:31:27,044 INFO L175 Difference]: Start difference. First operand has 278 places, 279 transitions, 629 flow. Second operand 3 states and 904 transitions. [2025-01-09 21:31:27,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 283 transitions, 675 flow [2025-01-09 21:31:27,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 283 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:27,047 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 639 flow [2025-01-09 21:31:27,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2025-01-09 21:31:27,047 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-01-09 21:31:27,047 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 639 flow [2025-01-09 21:31:27,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 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:27,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:27,048 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] [2025-01-09 21:31:27,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:31:27,048 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:27,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:27,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1045667757, now seen corresponding path program 1 times [2025-01-09 21:31:27,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:27,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475655233] [2025-01-09 21:31:27,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:27,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:27,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:31:27,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:31:27,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:27,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:27,081 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:31:27,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:27,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475655233] [2025-01-09 21:31:27,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475655233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:27,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:27,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:27,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350661775] [2025-01-09 21:31:27,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:27,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:27,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:27,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:27,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 316 [2025-01-09 21:31:27,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 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:27,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:27,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 316 [2025-01-09 21:31:27,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:27,280 INFO L124 PetriNetUnfolderBase]: 108/2291 cut-off events. [2025-01-09 21:31:27,280 INFO L125 PetriNetUnfolderBase]: For 24/59 co-relation queries the response was YES. [2025-01-09 21:31:27,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2687 conditions, 2291 events. 108/2291 cut-off events. For 24/59 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 19936 event pairs, 22 based on Foata normal form. 2/2086 useless extension candidates. Maximal degree in co-relation 2191. Up to 80 conditions per place. [2025-01-09 21:31:27,292 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-01-09 21:31:27,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 280 transitions, 669 flow [2025-01-09 21:31:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-01-09 21:31:27,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-01-09 21:31:27,294 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 639 flow. Second operand 3 states and 902 transitions. [2025-01-09 21:31:27,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 280 transitions, 669 flow [2025-01-09 21:31:27,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 280 transitions, 669 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:27,298 INFO L231 Difference]: Finished difference. Result has 280 places, 278 transitions, 641 flow [2025-01-09 21:31:27,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=280, PETRI_TRANSITIONS=278} [2025-01-09 21:31:27,299 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -9 predicate places. [2025-01-09 21:31:27,299 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 278 transitions, 641 flow [2025-01-09 21:31:27,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 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:27,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:27,299 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] [2025-01-09 21:31:27,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:31:27,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:27,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1345187915, now seen corresponding path program 1 times [2025-01-09 21:31:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:27,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829048260] [2025-01-09 21:31:27,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:27,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:31:27,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:31:27,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:27,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:27,353 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:31:27,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:27,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829048260] [2025-01-09 21:31:27,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829048260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:27,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292285266] [2025-01-09 21:31:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:27,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:27,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:27,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 316 [2025-01-09 21:31:27,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 278 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 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:27,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:27,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 316 [2025-01-09 21:31:27,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:27,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([832] L55-25-->L55-26: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet12#1][179], [24#L55-26true, Black: 351#true, 338#(= |#race~length_2~0| 0), Black: 355#true, 359#true, 362#true, 66#L76true, Black: 332#true, 353#(= |#race~length_4~0| 0), 346#(= |#race~to_int_3~0| 0), Black: 336#true, 334#(= |#race~length_0~0| 0), Black: 340#true, Black: 344#true, 357#(= |#race~to_int_5~0| 0), 342#(= |#race~to_int_1~0| 0)]) [2025-01-09 21:31:27,786 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-01-09 21:31:27,786 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is not cut-off event [2025-01-09 21:31:27,786 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-01-09 21:31:27,786 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-01-09 21:31:27,789 INFO L124 PetriNetUnfolderBase]: 136/1683 cut-off events. [2025-01-09 21:31:27,789 INFO L125 PetriNetUnfolderBase]: For 87/114 co-relation queries the response was YES. [2025-01-09 21:31:27,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 1683 events. 136/1683 cut-off events. For 87/114 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 13916 event pairs, 36 based on Foata normal form. 1/1548 useless extension candidates. Maximal degree in co-relation 1861. Up to 160 conditions per place. [2025-01-09 21:31:27,802 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-01-09 21:31:27,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 279 transitions, 671 flow [2025-01-09 21:31:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-01-09 21:31:27,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-01-09 21:31:27,804 INFO L175 Difference]: Start difference. First operand has 280 places, 278 transitions, 641 flow. Second operand 3 states and 902 transitions. [2025-01-09 21:31:27,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 279 transitions, 671 flow [2025-01-09 21:31:27,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 279 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:27,808 INFO L231 Difference]: Finished difference. Result has 279 places, 277 transitions, 639 flow [2025-01-09 21:31:27,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=279, PETRI_TRANSITIONS=277} [2025-01-09 21:31:27,809 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-01-09 21:31:27,809 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 277 transitions, 639 flow [2025-01-09 21:31:27,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 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:27,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:27,810 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] [2025-01-09 21:31:27,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:31:27,810 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:27,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2048670741, now seen corresponding path program 1 times [2025-01-09 21:31:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:27,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111181973] [2025-01-09 21:31:27,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:27,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:27,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:31:27,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:31:27,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:27,864 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:31:27,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:27,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111181973] [2025-01-09 21:31:27,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111181973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:27,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:27,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:27,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571899675] [2025-01-09 21:31:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:27,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:27,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:27,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:27,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:27,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 316 [2025-01-09 21:31:27,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 277 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 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:27,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:27,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 316 [2025-01-09 21:31:27,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:28,055 INFO L124 PetriNetUnfolderBase]: 73/1997 cut-off events. [2025-01-09 21:31:28,056 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2025-01-09 21:31:28,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1997 events. 73/1997 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 16182 event pairs, 4 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 1998. Up to 66 conditions per place. [2025-01-09 21:31:28,064 INFO L140 encePairwiseOnDemand]: 314/316 looper letters, 8 selfloop transitions, 1 changer transitions 0/276 dead transitions. [2025-01-09 21:31:28,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 276 transitions, 655 flow [2025-01-09 21:31:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2025-01-09 21:31:28,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535864978902954 [2025-01-09 21:31:28,065 INFO L175 Difference]: Start difference. First operand has 279 places, 277 transitions, 639 flow. Second operand 3 states and 904 transitions. [2025-01-09 21:31:28,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 276 transitions, 655 flow [2025-01-09 21:31:28,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 276 transitions, 651 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:28,069 INFO L231 Difference]: Finished difference. Result has 278 places, 276 transitions, 635 flow [2025-01-09 21:31:28,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=278, PETRI_TRANSITIONS=276} [2025-01-09 21:31:28,069 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-01-09 21:31:28,069 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 276 transitions, 635 flow [2025-01-09 21:31:28,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 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:28,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:28,070 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] [2025-01-09 21:31:28,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:31:28,070 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:28,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1221589917, now seen corresponding path program 1 times [2025-01-09 21:31:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:28,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15815100] [2025-01-09 21:31:28,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:28,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 21:31:28,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 21:31:28,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:28,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:28,104 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:31:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15815100] [2025-01-09 21:31:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15815100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:28,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:28,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068741282] [2025-01-09 21:31:28,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:28,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:28,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:28,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:28,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:28,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 316 [2025-01-09 21:31:28,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 276 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 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:28,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:28,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 316 [2025-01-09 21:31:28,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:28,244 INFO L124 PetriNetUnfolderBase]: 70/2132 cut-off events. [2025-01-09 21:31:28,244 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2025-01-09 21:31:28,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 2132 events. 70/2132 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 17559 event pairs, 11 based on Foata normal form. 0/1985 useless extension candidates. Maximal degree in co-relation 2327. Up to 67 conditions per place. [2025-01-09 21:31:28,257 INFO L140 encePairwiseOnDemand]: 314/316 looper letters, 8 selfloop transitions, 1 changer transitions 0/275 dead transitions. [2025-01-09 21:31:28,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 275 transitions, 651 flow [2025-01-09 21:31:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2025-01-09 21:31:28,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535864978902954 [2025-01-09 21:31:28,258 INFO L175 Difference]: Start difference. First operand has 278 places, 276 transitions, 635 flow. Second operand 3 states and 904 transitions. [2025-01-09 21:31:28,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 275 transitions, 651 flow [2025-01-09 21:31:28,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 275 transitions, 650 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:28,261 INFO L231 Difference]: Finished difference. Result has 278 places, 275 transitions, 634 flow [2025-01-09 21:31:28,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=278, PETRI_TRANSITIONS=275} [2025-01-09 21:31:28,262 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-01-09 21:31:28,262 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 275 transitions, 634 flow [2025-01-09 21:31:28,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 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:28,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:28,262 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] [2025-01-09 21:31:28,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:31:28,262 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:31:28,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:28,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1570093863, now seen corresponding path program 1 times [2025-01-09 21:31:28,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:28,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270805038] [2025-01-09 21:31:28,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:28,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 21:31:28,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 21:31:28,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:28,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:28,292 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:31:28,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:28,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270805038] [2025-01-09 21:31:28,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270805038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:28,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:28,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671266274] [2025-01-09 21:31:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:28,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:28,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:28,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:28,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 316 [2025-01-09 21:31:28,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 275 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 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:28,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:28,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 316 [2025-01-09 21:31:28,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:28,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L55-26-->L55-27: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_8~0=|v_#race~result_8~0_1|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_8~0][186], [368#true, Black: 351#true, 338#(= |#race~length_2~0| 0), Black: 355#true, 66#L76true, Black: 332#true, 353#(= |#race~length_4~0| 0), 346#(= |#race~to_int_3~0| 0), Black: 336#true, 334#(= |#race~length_0~0| 0), Black: 340#true, 357#(= |#race~to_int_5~0| 0), Black: 344#true, 371#true, 82#L55-27true, 342#(= |#race~to_int_1~0| 0)]) [2025-01-09 21:31:28,394 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2025-01-09 21:31:28,394 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:31:28,394 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:31:28,394 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:31:28,395 INFO L124 PetriNetUnfolderBase]: 68/1501 cut-off events. [2025-01-09 21:31:28,395 INFO L125 PetriNetUnfolderBase]: For 21/36 co-relation queries the response was YES. [2025-01-09 21:31:28,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 1501 events. 68/1501 cut-off events. For 21/36 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 11457 event pairs, 18 based on Foata normal form. 10/1395 useless extension candidates. Maximal degree in co-relation 1722. Up to 87 conditions per place. [2025-01-09 21:31:28,403 INFO L140 encePairwiseOnDemand]: 314/316 looper letters, 0 selfloop transitions, 0 changer transitions 274/274 dead transitions. [2025-01-09 21:31:28,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 274 transitions, 648 flow [2025-01-09 21:31:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2025-01-09 21:31:28,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525316455696202 [2025-01-09 21:31:28,404 INFO L175 Difference]: Start difference. First operand has 278 places, 275 transitions, 634 flow. Second operand 3 states and 903 transitions. [2025-01-09 21:31:28,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 274 transitions, 648 flow [2025-01-09 21:31:28,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 274 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:28,407 INFO L231 Difference]: Finished difference. Result has 278 places, 0 transitions, 0 flow [2025-01-09 21:31:28,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=278, PETRI_TRANSITIONS=0} [2025-01-09 21:31:28,407 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-01-09 21:31:28,407 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 0 transitions, 0 flow [2025-01-09 21:31:28,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 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:28,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 48 remaining) [2025-01-09 21:31:28,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 48 remaining) [2025-01-09 21:31:28,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (42 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (41 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (40 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (39 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (35 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (33 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (31 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (30 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (23 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (21 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (13 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 48 remaining) [2025-01-09 21:31:28,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 48 remaining) [2025-01-09 21:31:28,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 48 remaining) [2025-01-09 21:31:28,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:31:28,411 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:28,415 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:31:28,415 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:31:28,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:31:28 BasicIcfg [2025-01-09 21:31:28,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:31:28,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:31:28,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:31:28,419 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:31:28,424 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:24" (3/4) ... [2025-01-09 21:31:28,425 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:31:28,427 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:31:28,427 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:31:28,427 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:31:28,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:31:28,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:31:28,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:31:28,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:31:28,487 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:31:28,488 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:31:28,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:31:28,489 INFO L158 Benchmark]: Toolchain (without parser) took 5030.12ms. Allocated memory was 201.3MB in the beginning and 436.2MB in the end (delta: 234.9MB). Free memory was 158.2MB in the beginning and 394.6MB in the end (delta: -236.4MB). Peak memory consumption was 251.6MB. Max. memory is 16.1GB. [2025-01-09 21:31:28,489 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 218.1MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:28,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.38ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 146.4MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:28,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.49ms. Allocated memory is still 201.3MB. Free memory was 146.4MB in the beginning and 144.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:28,489 INFO L158 Benchmark]: Boogie Preprocessor took 27.33ms. Allocated memory is still 201.3MB. Free memory was 144.5MB in the beginning and 143.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:28,489 INFO L158 Benchmark]: RCFGBuilder took 344.72ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 120.9MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:31:28,490 INFO L158 Benchmark]: TraceAbstraction took 4260.94ms. Allocated memory was 201.3MB in the beginning and 436.2MB in the end (delta: 234.9MB). Free memory was 120.3MB in the beginning and 144.4MB in the end (delta: -24.2MB). Peak memory consumption was 209.6MB. Max. memory is 16.1GB. [2025-01-09 21:31:28,490 INFO L158 Benchmark]: Witness Printer took 68.64ms. Allocated memory is still 436.2MB. Free memory was 144.4MB in the beginning and 394.6MB in the end (delta: -250.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:28,491 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.14ms. Allocated memory is still 218.1MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.38ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 146.4MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.49ms. Allocated memory is still 201.3MB. Free memory was 146.4MB in the beginning and 144.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.33ms. Allocated memory is still 201.3MB. Free memory was 144.5MB in the beginning and 143.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 344.72ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 120.9MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4260.94ms. Allocated memory was 201.3MB in the beginning and 436.2MB in the end (delta: 234.9MB). Free memory was 120.3MB in the beginning and 144.4MB in the end (delta: -24.2MB). Peak memory consumption was 209.6MB. Max. memory is 16.1GB. * Witness Printer took 68.64ms. Allocated memory is still 436.2MB. Free memory was 144.4MB in the beginning and 394.6MB in the end (delta: -250.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: 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: 55]: 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: 55]: 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: 55]: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 79]: 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: 79]: 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, 479 locations, 48 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: 4.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 480 IncrementalHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 74 mSDtfsCounter, 480 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=14, InterpolantAutomatonStates: 54, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1451 ConstructedInterpolants, 0 QuantifiedInterpolants, 1487 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:31:28,502 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