./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x3.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/bench-exp2x3.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 f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:41,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:41,871 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:29:41,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:41,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:41,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:41,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:41,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:41,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:41,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:41,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:41,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:41,890 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:41,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:41,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:41,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:41,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:41,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:41,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:41,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:41,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:41,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:41,890 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:41,891 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:41,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:41,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:41,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:41,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:41,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:41,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:41,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:41,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:41,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:41,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:41,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:41,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:41,892 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 -> f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 [2025-01-09 21:29:42,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:42,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:42,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:42,088 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:42,088 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:42,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2025-01-09 21:29:43,195 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9138d967/055c84493b79443ba97aa1ddd29b86e2/FLAGc87eecd98 [2025-01-09 21:29:43,420 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:43,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2025-01-09 21:29:43,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9138d967/055c84493b79443ba97aa1ddd29b86e2/FLAGc87eecd98 [2025-01-09 21:29:43,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d9138d967/055c84493b79443ba97aa1ddd29b86e2 [2025-01-09 21:29:43,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:43,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:43,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:43,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:43,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:43,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575fa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43, skipping insertion in model container [2025-01-09 21:29:43,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:43,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:43,908 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:43,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:43,934 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:43,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43 WrapperNode [2025-01-09 21:29:43,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:43,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:43,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:43,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:43,939 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:29:43" (1/1) ... [2025-01-09 21:29:43,944 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:29:43" (1/1) ... [2025-01-09 21:29:43,954 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-01-09 21:29:43,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:43,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:43,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:43,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:43,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:43,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:43,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:43,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:43,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (1/1) ... [2025-01-09 21:29:43,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:43,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:43,992 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:29:43,994 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:29:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:29:44,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:29:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:29:44,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:29:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:29:44,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:29:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:29:44,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:29:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:44,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:44,013 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:29:44,088 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:44,089 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:44,285 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:44,285 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:44,297 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:44,298 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:29:44,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:44 BoogieIcfgContainer [2025-01-09 21:29:44,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:44,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:44,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:44,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:44,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:43" (1/3) ... [2025-01-09 21:29:44,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2966184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:44, skipping insertion in model container [2025-01-09 21:29:44,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:43" (2/3) ... [2025-01-09 21:29:44,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2966184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:44, skipping insertion in model container [2025-01-09 21:29:44,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:44" (3/3) ... [2025-01-09 21:29:44,305 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2025-01-09 21:29:44,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:44,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x3.wvr.c that has 5 procedures, 246 locations, 1 initial locations, 4 loop locations, and 35 error locations. [2025-01-09 21:29:44,316 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:44,420 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:29:44,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 259 transitions, 546 flow [2025-01-09 21:29:44,551 INFO L124 PetriNetUnfolderBase]: 14/255 cut-off events. [2025-01-09 21:29:44,553 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:29:44,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 255 events. 14/255 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 412 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2025-01-09 21:29:44,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 259 transitions, 546 flow [2025-01-09 21:29:44,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 235 transitions, 494 flow [2025-01-09 21:29:44,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:44,588 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;@96fea76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:44,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-01-09 21:29:44,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:44,600 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:29:44,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:44,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:44,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:44,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:44,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:44,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1893610304, now seen corresponding path program 1 times [2025-01-09 21:29:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:44,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144329394] [2025-01-09 21:29:44,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:44,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:44,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:29:44,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:29:44,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:44,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:44,745 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:29:44,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:44,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144329394] [2025-01-09 21:29:44,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144329394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:44,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:44,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:44,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528626941] [2025-01-09 21:29:44,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:44,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:44,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:44,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:44,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 259 [2025-01-09 21:29:44,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 235 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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:29:44,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:44,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 259 [2025-01-09 21:29:44,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:44,895 INFO L124 PetriNetUnfolderBase]: 22/310 cut-off events. [2025-01-09 21:29:44,895 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:29:44,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 310 events. 22/310 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 992 event pairs, 12 based on Foata normal form. 37/285 useless extension candidates. Maximal degree in co-relation 294. Up to 46 conditions per place. [2025-01-09 21:29:44,900 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 18 selfloop transitions, 2 changer transitions 1/229 dead transitions. [2025-01-09 21:29:44,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 229 transitions, 522 flow [2025-01-09 21:29:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2025-01-09 21:29:44,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214929214929215 [2025-01-09 21:29:44,931 INFO L175 Difference]: Start difference. First operand has 236 places, 235 transitions, 494 flow. Second operand 3 states and 716 transitions. [2025-01-09 21:29:44,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 229 transitions, 522 flow [2025-01-09 21:29:44,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 229 transitions, 506 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 21:29:44,939 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 468 flow [2025-01-09 21:29:44,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2025-01-09 21:29:44,945 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -7 predicate places. [2025-01-09 21:29:44,945 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 468 flow [2025-01-09 21:29:44,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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:29:44,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:44,946 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] [2025-01-09 21:29:44,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:44,946 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:44,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash 589359710, now seen corresponding path program 1 times [2025-01-09 21:29:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:44,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863024214] [2025-01-09 21:29:44,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:44,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:29:44,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:29:44,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:44,983 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:29:44,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:44,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863024214] [2025-01-09 21:29:44,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863024214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:44,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:44,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:44,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604195305] [2025-01-09 21:29:44,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:44,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:44,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:44,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:44,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:45,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259 [2025-01-09 21:29:45,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 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:29:45,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:45,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259 [2025-01-09 21:29:45,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:45,058 INFO L124 PetriNetUnfolderBase]: 22/308 cut-off events. [2025-01-09 21:29:45,058 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:29:45,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 308 events. 22/308 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 920 event pairs, 12 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 341. Up to 45 conditions per place. [2025-01-09 21:29:45,061 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 17 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2025-01-09 21:29:45,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 227 transitions, 504 flow [2025-01-09 21:29:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-01-09 21:29:45,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176 [2025-01-09 21:29:45,063 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 468 flow. Second operand 3 states and 713 transitions. [2025-01-09 21:29:45,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 227 transitions, 504 flow [2025-01-09 21:29:45,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 227 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:45,066 INFO L231 Difference]: Finished difference. Result has 227 places, 227 transitions, 466 flow [2025-01-09 21:29:45,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=227, PETRI_TRANSITIONS=227} [2025-01-09 21:29:45,067 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -9 predicate places. [2025-01-09 21:29:45,067 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 227 transitions, 466 flow [2025-01-09 21:29:45,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 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:29:45,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:45,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:45,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:45,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:45,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1805642568, now seen corresponding path program 1 times [2025-01-09 21:29:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686189785] [2025-01-09 21:29:45,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:45,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:29:45,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:29:45,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:45,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:45,106 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:29:45,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:45,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686189785] [2025-01-09 21:29:45,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686189785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:45,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:45,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:45,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279663781] [2025-01-09 21:29:45,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:45,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:45,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:45,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:45,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:45,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 259 [2025-01-09 21:29:45,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 227 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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:29:45,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:45,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 259 [2025-01-09 21:29:45,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:45,175 INFO L124 PetriNetUnfolderBase]: 22/289 cut-off events. [2025-01-09 21:29:45,175 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:29:45,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 289 events. 22/289 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 785 event pairs, 12 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 312. Up to 46 conditions per place. [2025-01-09 21:29:45,177 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 18 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2025-01-09 21:29:45,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 226 transitions, 504 flow [2025-01-09 21:29:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2025-01-09 21:29:45,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915057915057915 [2025-01-09 21:29:45,179 INFO L175 Difference]: Start difference. First operand has 227 places, 227 transitions, 466 flow. Second operand 3 states and 711 transitions. [2025-01-09 21:29:45,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 226 transitions, 504 flow [2025-01-09 21:29:45,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 226 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:45,182 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 464 flow [2025-01-09 21:29:45,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2025-01-09 21:29:45,183 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -10 predicate places. [2025-01-09 21:29:45,183 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 464 flow [2025-01-09 21:29:45,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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:29:45,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:45,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:45,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:45,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:45,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash -540587402, now seen corresponding path program 1 times [2025-01-09 21:29:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:45,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389694609] [2025-01-09 21:29:45,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:45,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:29:45,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:29:45,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:45,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:45,216 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:29:45,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:45,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389694609] [2025-01-09 21:29:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389694609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420455584] [2025-01-09 21:29:45,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:45,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:45,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:45,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:45,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:45,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259 [2025-01-09 21:29:45,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 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:29:45,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:45,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259 [2025-01-09 21:29:45,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:45,305 INFO L124 PetriNetUnfolderBase]: 22/270 cut-off events. [2025-01-09 21:29:45,305 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:29:45,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 270 events. 22/270 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 621 event pairs, 12 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 281. Up to 45 conditions per place. [2025-01-09 21:29:45,307 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 17 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-01-09 21:29:45,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 225 transitions, 500 flow [2025-01-09 21:29:45,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-01-09 21:29:45,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176 [2025-01-09 21:29:45,311 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 464 flow. Second operand 3 states and 713 transitions. [2025-01-09 21:29:45,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 225 transitions, 500 flow [2025-01-09 21:29:45,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 225 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:45,314 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 462 flow [2025-01-09 21:29:45,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2025-01-09 21:29:45,315 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -11 predicate places. [2025-01-09 21:29:45,315 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 462 flow [2025-01-09 21:29:45,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 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:29:45,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:45,316 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:29:45,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:45,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:45,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1416721517, now seen corresponding path program 1 times [2025-01-09 21:29:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:45,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730985960] [2025-01-09 21:29:45,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:45,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:45,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:29:45,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:29:45,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:45,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:45,367 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:29:45,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:45,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730985960] [2025-01-09 21:29:45,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730985960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:45,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:45,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:45,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500439161] [2025-01-09 21:29:45,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:45,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:45,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:45,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:45,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:45,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259 [2025-01-09 21:29:45,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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:29:45,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:45,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259 [2025-01-09 21:29:45,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:45,501 INFO L124 PetriNetUnfolderBase]: 102/982 cut-off events. [2025-01-09 21:29:45,501 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:29:45,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 982 events. 102/982 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6254 event pairs, 51 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 1096. Up to 144 conditions per place. [2025-01-09 21:29:45,513 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 15 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2025-01-09 21:29:45,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 224 transitions, 494 flow [2025-01-09 21:29:45,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-01-09 21:29:45,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228 [2025-01-09 21:29:45,518 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 462 flow. Second operand 3 states and 717 transitions. [2025-01-09 21:29:45,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 224 transitions, 494 flow [2025-01-09 21:29:45,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 224 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:45,522 INFO L231 Difference]: Finished difference. Result has 224 places, 224 transitions, 460 flow [2025-01-09 21:29:45,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=224, PETRI_TRANSITIONS=224} [2025-01-09 21:29:45,523 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -12 predicate places. [2025-01-09 21:29:45,524 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 224 transitions, 460 flow [2025-01-09 21:29:45,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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:29:45,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:45,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:45,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:45,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:45,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:45,529 INFO L85 PathProgramCache]: Analyzing trace with hash 494668568, now seen corresponding path program 1 times [2025-01-09 21:29:45,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:45,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441181034] [2025-01-09 21:29:45,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:45,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:45,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:29:45,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:29:45,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:45,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:45,585 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:29:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:45,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441181034] [2025-01-09 21:29:45,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441181034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:45,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:45,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271068169] [2025-01-09 21:29:45,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:45,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:45,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:45,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:45,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:45,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 259 [2025-01-09 21:29:45,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 224 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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:29:45,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:45,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 259 [2025-01-09 21:29:45,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:45,659 INFO L124 PetriNetUnfolderBase]: 31/300 cut-off events. [2025-01-09 21:29:45,660 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:29:45,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 300 events. 31/300 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1011 event pairs, 18 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 340. Up to 60 conditions per place. [2025-01-09 21:29:45,664 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 23 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-01-09 21:29:45,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 222 transitions, 511 flow [2025-01-09 21:29:45,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2025-01-09 21:29:45,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060489060489061 [2025-01-09 21:29:45,666 INFO L175 Difference]: Start difference. First operand has 224 places, 224 transitions, 460 flow. Second operand 3 states and 704 transitions. [2025-01-09 21:29:45,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 222 transitions, 511 flow [2025-01-09 21:29:45,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 222 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:45,670 INFO L231 Difference]: Finished difference. Result has 219 places, 219 transitions, 457 flow [2025-01-09 21:29:45,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=219, PETRI_TRANSITIONS=219} [2025-01-09 21:29:45,672 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -17 predicate places. [2025-01-09 21:29:45,673 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 219 transitions, 457 flow [2025-01-09 21:29:45,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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:29:45,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:45,674 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] [2025-01-09 21:29:45,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:29:45,674 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:45,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1364864359, now seen corresponding path program 1 times [2025-01-09 21:29:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:45,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745917318] [2025-01-09 21:29:45,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:45,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:45,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:29:45,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:29:45,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:45,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:45,723 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:29:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745917318] [2025-01-09 21:29:45,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745917318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:45,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:45,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235593648] [2025-01-09 21:29:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:45,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:45,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:45,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:45,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:45,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 259 [2025-01-09 21:29:45,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 219 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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:29:45,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:45,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 259 [2025-01-09 21:29:45,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:45,782 INFO L124 PetriNetUnfolderBase]: 31/296 cut-off events. [2025-01-09 21:29:45,782 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:29:45,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 296 events. 31/296 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 967 event pairs, 18 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 322. Up to 58 conditions per place. [2025-01-09 21:29:45,784 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 21 selfloop transitions, 3 changer transitions 0/218 dead transitions. [2025-01-09 21:29:45,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 506 flow [2025-01-09 21:29:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-01-09 21:29:45,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137709137709138 [2025-01-09 21:29:45,786 INFO L175 Difference]: Start difference. First operand has 219 places, 219 transitions, 457 flow. Second operand 3 states and 710 transitions. [2025-01-09 21:29:45,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 506 flow [2025-01-09 21:29:45,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 218 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:45,789 INFO L231 Difference]: Finished difference. Result has 216 places, 215 transitions, 457 flow [2025-01-09 21:29:45,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=216, PETRI_TRANSITIONS=215} [2025-01-09 21:29:45,790 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -20 predicate places. [2025-01-09 21:29:45,790 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 215 transitions, 457 flow [2025-01-09 21:29:45,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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:29:45,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:45,791 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] [2025-01-09 21:29:45,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:29:45,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:45,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2092822495, now seen corresponding path program 1 times [2025-01-09 21:29:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:45,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126301664] [2025-01-09 21:29:45,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:45,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:29:45,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:29:45,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:45,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:45,839 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:29:45,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:45,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126301664] [2025-01-09 21:29:45,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126301664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:45,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:45,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:45,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308875251] [2025-01-09 21:29:45,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:45,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:45,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:45,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:45,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 259 [2025-01-09 21:29:45,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 215 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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:29:45,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:45,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 259 [2025-01-09 21:29:45,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:45,928 INFO L124 PetriNetUnfolderBase]: 39/409 cut-off events. [2025-01-09 21:29:45,928 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:29:45,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 409 events. 39/409 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1623 event pairs, 15 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 444. Up to 64 conditions per place. [2025-01-09 21:29:45,931 INFO L140 encePairwiseOnDemand]: 249/259 looper letters, 26 selfloop transitions, 4 changer transitions 0/217 dead transitions. [2025-01-09 21:29:45,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 217 transitions, 527 flow [2025-01-09 21:29:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2025-01-09 21:29:45,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9111969111969112 [2025-01-09 21:29:45,933 INFO L175 Difference]: Start difference. First operand has 216 places, 215 transitions, 457 flow. Second operand 3 states and 708 transitions. [2025-01-09 21:29:45,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 217 transitions, 527 flow [2025-01-09 21:29:45,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 217 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:45,937 INFO L231 Difference]: Finished difference. Result has 212 places, 211 transitions, 462 flow [2025-01-09 21:29:45,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=212, PETRI_TRANSITIONS=211} [2025-01-09 21:29:45,938 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -24 predicate places. [2025-01-09 21:29:45,939 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 211 transitions, 462 flow [2025-01-09 21:29:45,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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:29:45,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:45,940 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] [2025-01-09 21:29:45,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:29:45,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:45,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1157707345, now seen corresponding path program 1 times [2025-01-09 21:29:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:45,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598521245] [2025-01-09 21:29:45,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:45,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:29:45,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:29:45,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:45,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:45,999 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:29:45,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:45,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598521245] [2025-01-09 21:29:45,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598521245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:45,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:45,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:29:45,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567005349] [2025-01-09 21:29:45,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:46,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:29:46,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:46,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:29:46,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:29:46,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259 [2025-01-09 21:29:46,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 211 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 233.25) internal successors, (933), 4 states have internal predecessors, (933), 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:29:46,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:46,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259 [2025-01-09 21:29:46,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:46,062 INFO L124 PetriNetUnfolderBase]: 12/347 cut-off events. [2025-01-09 21:29:46,062 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:29:46,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 347 events. 12/347 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1120 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 291. Up to 26 conditions per place. [2025-01-09 21:29:46,064 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 19 selfloop transitions, 5 changer transitions 0/216 dead transitions. [2025-01-09 21:29:46,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 216 transitions, 520 flow [2025-01-09 21:29:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:29:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:29:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1185 transitions. [2025-01-09 21:29:46,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915057915057915 [2025-01-09 21:29:46,066 INFO L175 Difference]: Start difference. First operand has 212 places, 211 transitions, 462 flow. Second operand 5 states and 1185 transitions. [2025-01-09 21:29:46,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 216 transitions, 520 flow [2025-01-09 21:29:46,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 216 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:46,079 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 496 flow [2025-01-09 21:29:46,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=496, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2025-01-09 21:29:46,080 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -17 predicate places. [2025-01-09 21:29:46,080 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 496 flow [2025-01-09 21:29:46,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.25) internal successors, (933), 4 states have internal predecessors, (933), 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:29:46,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:46,081 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] [2025-01-09 21:29:46,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:29:46,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:46,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash -886145460, now seen corresponding path program 1 times [2025-01-09 21:29:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:46,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965858251] [2025-01-09 21:29:46,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:46,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:46,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:29:46,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:29:46,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:46,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:46,103 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:29:46,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:46,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965858251] [2025-01-09 21:29:46,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965858251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:46,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:46,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:46,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908168188] [2025-01-09 21:29:46,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:46,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:46,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:46,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:46,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:46,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 259 [2025-01-09 21:29:46,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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:29:46,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:46,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 259 [2025-01-09 21:29:46,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:46,181 INFO L124 PetriNetUnfolderBase]: 58/561 cut-off events. [2025-01-09 21:29:46,181 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-09 21:29:46,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 561 events. 58/561 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2806 event pairs, 5 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 497. Up to 92 conditions per place. [2025-01-09 21:29:46,185 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 22 selfloop transitions, 3 changer transitions 10/218 dead transitions. [2025-01-09 21:29:46,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 563 flow [2025-01-09 21:29:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-01-09 21:29:46,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176 [2025-01-09 21:29:46,186 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 496 flow. Second operand 3 states and 713 transitions. [2025-01-09 21:29:46,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 563 flow [2025-01-09 21:29:46,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 218 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:46,190 INFO L231 Difference]: Finished difference. Result has 217 places, 201 transitions, 478 flow [2025-01-09 21:29:46,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=217, PETRI_TRANSITIONS=201} [2025-01-09 21:29:46,190 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -19 predicate places. [2025-01-09 21:29:46,190 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 201 transitions, 478 flow [2025-01-09 21:29:46,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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:29:46,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:46,191 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] [2025-01-09 21:29:46,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:29:46,191 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:46,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash 665431233, now seen corresponding path program 1 times [2025-01-09 21:29:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:46,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270878035] [2025-01-09 21:29:46,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:46,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:46,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:29:46,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:29:46,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:46,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:46,217 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:29:46,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:46,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270878035] [2025-01-09 21:29:46,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270878035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:46,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:46,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314235586] [2025-01-09 21:29:46,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:46,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:46,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:46,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:46,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259 [2025-01-09 21:29:46,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 201 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 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:29:46,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:46,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259 [2025-01-09 21:29:46,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:46,562 INFO L124 PetriNetUnfolderBase]: 746/4032 cut-off events. [2025-01-09 21:29:46,562 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-01-09 21:29:46,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5626 conditions, 4032 events. 746/4032 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 40541 event pairs, 276 based on Foata normal form. 0/3543 useless extension candidates. Maximal degree in co-relation 4163. Up to 1027 conditions per place. [2025-01-09 21:29:46,585 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 19 selfloop transitions, 4 changer transitions 0/204 dead transitions. [2025-01-09 21:29:46,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 204 transitions, 533 flow [2025-01-09 21:29:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2025-01-09 21:29:46,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9266409266409267 [2025-01-09 21:29:46,587 INFO L175 Difference]: Start difference. First operand has 217 places, 201 transitions, 478 flow. Second operand 3 states and 720 transitions. [2025-01-09 21:29:46,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 204 transitions, 533 flow [2025-01-09 21:29:46,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 204 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:46,593 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 495 flow [2025-01-09 21:29:46,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=205, PETRI_TRANSITIONS=201} [2025-01-09 21:29:46,594 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -31 predicate places. [2025-01-09 21:29:46,595 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 495 flow [2025-01-09 21:29:46,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 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:29:46,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:46,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:29:46,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:46,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1080236203, now seen corresponding path program 1 times [2025-01-09 21:29:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:46,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039359398] [2025-01-09 21:29:46,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:46,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:46,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:29:46,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:29:46,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:46,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:46,626 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:29:46,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:46,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039359398] [2025-01-09 21:29:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039359398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:46,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:46,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102739613] [2025-01-09 21:29:46,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:46,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:46,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:46,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:46,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:46,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259 [2025-01-09 21:29:46,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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:29:46,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:46,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259 [2025-01-09 21:29:46,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:46,903 INFO L124 PetriNetUnfolderBase]: 203/1313 cut-off events. [2025-01-09 21:29:46,903 INFO L125 PetriNetUnfolderBase]: For 23/35 co-relation queries the response was YES. [2025-01-09 21:29:46,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 1313 events. 203/1313 cut-off events. For 23/35 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 9901 event pairs, 64 based on Foata normal form. 0/1175 useless extension candidates. Maximal degree in co-relation 1269. Up to 174 conditions per place. [2025-01-09 21:29:46,915 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 19 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2025-01-09 21:29:46,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 203 transitions, 544 flow [2025-01-09 21:29:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-01-09 21:29:46,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228 [2025-01-09 21:29:46,917 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 495 flow. Second operand 3 states and 717 transitions. [2025-01-09 21:29:46,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 203 transitions, 544 flow [2025-01-09 21:29:46,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 203 transitions, 544 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:46,920 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 497 flow [2025-01-09 21:29:46,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=206, PETRI_TRANSITIONS=200} [2025-01-09 21:29:46,921 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -30 predicate places. [2025-01-09 21:29:46,921 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 497 flow [2025-01-09 21:29:46,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 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:29:46,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:46,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:46,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:29:46,922 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:46,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1820925681, now seen corresponding path program 1 times [2025-01-09 21:29:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:46,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143240730] [2025-01-09 21:29:46,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:46,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:46,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:29:46,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:29:46,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:46,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:46,955 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:29:46,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:46,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143240730] [2025-01-09 21:29:46,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143240730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:46,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:46,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247318228] [2025-01-09 21:29:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:46,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:46,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:46,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:46,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259 [2025-01-09 21:29:46,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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:29:46,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:46,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259 [2025-01-09 21:29:46,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:47,168 INFO L124 PetriNetUnfolderBase]: 314/1609 cut-off events. [2025-01-09 21:29:47,168 INFO L125 PetriNetUnfolderBase]: For 88/96 co-relation queries the response was YES. [2025-01-09 21:29:47,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 1609 events. 314/1609 cut-off events. For 88/96 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12836 event pairs, 121 based on Foata normal form. 0/1477 useless extension candidates. Maximal degree in co-relation 2449. Up to 298 conditions per place. [2025-01-09 21:29:47,183 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 18 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2025-01-09 21:29:47,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 202 transitions, 544 flow [2025-01-09 21:29:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2025-01-09 21:29:47,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253539253539254 [2025-01-09 21:29:47,186 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 497 flow. Second operand 3 states and 719 transitions. [2025-01-09 21:29:47,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 202 transitions, 544 flow [2025-01-09 21:29:47,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 202 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:47,189 INFO L231 Difference]: Finished difference. Result has 205 places, 199 transitions, 495 flow [2025-01-09 21:29:47,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=205, PETRI_TRANSITIONS=199} [2025-01-09 21:29:47,190 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -31 predicate places. [2025-01-09 21:29:47,190 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 199 transitions, 495 flow [2025-01-09 21:29:47,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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:29:47,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:47,191 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] [2025-01-09 21:29:47,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:29:47,191 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:47,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1603290273, now seen corresponding path program 1 times [2025-01-09 21:29:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:47,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910882283] [2025-01-09 21:29:47,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:47,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:29:47,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:29:47,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:47,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:47,227 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:29:47,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:47,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910882283] [2025-01-09 21:29:47,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910882283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:47,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:47,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:47,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750562509] [2025-01-09 21:29:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:47,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:47,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:47,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:47,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:47,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259 [2025-01-09 21:29:47,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 199 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:29:47,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:47,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259 [2025-01-09 21:29:47,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:47,379 INFO L124 PetriNetUnfolderBase]: 228/1269 cut-off events. [2025-01-09 21:29:47,379 INFO L125 PetriNetUnfolderBase]: For 95/98 co-relation queries the response was YES. [2025-01-09 21:29:47,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 1269 events. 228/1269 cut-off events. For 95/98 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 9014 event pairs, 80 based on Foata normal form. 0/1172 useless extension candidates. Maximal degree in co-relation 1803. Up to 228 conditions per place. [2025-01-09 21:29:47,389 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 20 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2025-01-09 21:29:47,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 546 flow [2025-01-09 21:29:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-01-09 21:29:47,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228 [2025-01-09 21:29:47,391 INFO L175 Difference]: Start difference. First operand has 205 places, 199 transitions, 495 flow. Second operand 3 states and 717 transitions. [2025-01-09 21:29:47,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 546 flow [2025-01-09 21:29:47,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 201 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:47,394 INFO L231 Difference]: Finished difference. Result has 204 places, 198 transitions, 493 flow [2025-01-09 21:29:47,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=204, PETRI_TRANSITIONS=198} [2025-01-09 21:29:47,394 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -32 predicate places. [2025-01-09 21:29:47,394 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 198 transitions, 493 flow [2025-01-09 21:29:47,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:29:47,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:47,395 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] [2025-01-09 21:29:47,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:29:47,395 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:29:47,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1546886484, now seen corresponding path program 1 times [2025-01-09 21:29:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:47,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43582212] [2025-01-09 21:29:47,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:47,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:47,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:29:47,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:29:47,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:47,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:47,424 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:29:47,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:47,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43582212] [2025-01-09 21:29:47,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43582212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:47,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:47,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:47,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835109294] [2025-01-09 21:29:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:47,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:47,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:47,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:47,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:47,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259 [2025-01-09 21:29:47,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 198 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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:29:47,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:47,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259 [2025-01-09 21:29:47,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:47,522 INFO L124 PetriNetUnfolderBase]: 145/1013 cut-off events. [2025-01-09 21:29:47,523 INFO L125 PetriNetUnfolderBase]: For 75/82 co-relation queries the response was YES. [2025-01-09 21:29:47,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 1013 events. 145/1013 cut-off events. For 75/82 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6576 event pairs, 39 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 1332. Up to 128 conditions per place. [2025-01-09 21:29:47,527 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 0 selfloop transitions, 0 changer transitions 200/200 dead transitions. [2025-01-09 21:29:47,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 200 transitions, 540 flow [2025-01-09 21:29:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2025-01-09 21:29:47,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253539253539254 [2025-01-09 21:29:47,529 INFO L175 Difference]: Start difference. First operand has 204 places, 198 transitions, 493 flow. Second operand 3 states and 719 transitions. [2025-01-09 21:29:47,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 200 transitions, 540 flow [2025-01-09 21:29:47,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 200 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:47,531 INFO L231 Difference]: Finished difference. Result has 203 places, 0 transitions, 0 flow [2025-01-09 21:29:47,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=203, PETRI_TRANSITIONS=0} [2025-01-09 21:29:47,532 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -33 predicate places. [2025-01-09 21:29:47,532 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 0 transitions, 0 flow [2025-01-09 21:29:47,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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:29:47,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (58 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (57 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (56 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (55 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (54 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (50 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (49 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (48 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (47 of 59 remaining) [2025-01-09 21:29:47,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (46 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (45 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (44 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 59 remaining) [2025-01-09 21:29:47,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (29 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (24 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (23 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (22 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (21 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (20 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (19 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (18 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (17 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (16 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (9 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (8 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (7 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (6 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (5 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (4 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (3 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (1 of 59 remaining) [2025-01-09 21:29:47,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (0 of 59 remaining) [2025-01-09 21:29:47,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:29:47,538 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:47,542 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:29:47,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:29:47,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:29:47 BasicIcfg [2025-01-09 21:29:47,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:29:47,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:29:47,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:29:47,546 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:29:47,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:44" (3/4) ... [2025-01-09 21:29:47,548 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:29:47,550 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:29:47,550 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:29:47,550 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:29:47,550 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:29:47,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-09 21:29:47,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:29:47,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:29:47,554 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:29:47,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:29:47,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:29:47,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:29:47,608 INFO L158 Benchmark]: Toolchain (without parser) took 3827.91ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 133.3MB in the beginning and 126.3MB in the end (delta: 7.0MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. [2025-01-09 21:29:47,608 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 226.5MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:29:47,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.82ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 121.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:29:47,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.14ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 119.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:29:47,608 INFO L158 Benchmark]: Boogie Preprocessor took 14.55ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 118.8MB in the end (delta: 795.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:29:47,609 INFO L158 Benchmark]: RCFGBuilder took 328.44ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 98.5MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:29:47,609 INFO L158 Benchmark]: TraceAbstraction took 3246.41ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 98.0MB in the beginning and 131.3MB in the end (delta: -33.3MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2025-01-09 21:29:47,609 INFO L158 Benchmark]: Witness Printer took 60.86ms. Allocated memory is still 318.8MB. Free memory was 131.3MB in the beginning and 126.3MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:29:47,610 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.42ms. Allocated memory is still 226.5MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.82ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 121.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.14ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 119.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.55ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 118.8MB in the end (delta: 795.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 328.44ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 98.5MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3246.41ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 98.0MB in the beginning and 131.3MB in the end (delta: -33.3MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. * Witness Printer took 60.86ms. Allocated memory is still 318.8MB. Free memory was 131.3MB in the beginning and 126.3MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 342 locations, 59 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: 3.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 681 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 697 IncrementalHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 103 mSDtfsCounter, 697 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=497occurred in iteration=12, InterpolantAutomatonStates: 47, 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.4s InterpolantComputationTime, 955 NumberOfCodeBlocks, 955 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:29:47,626 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