./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-file-item-subst.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 d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:29,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:29,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:29,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:29,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:29,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:29,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:29,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:29,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:29,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:29,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:29,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:29,536 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:29,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:29,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:29,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:29,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:29,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:29,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:29,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:29,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:29,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:29,536 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:29,537 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:29,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:29,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:29,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:29,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:29,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:29,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:29,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:29,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:29,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:29,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:29,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:29,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:29,539 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 -> d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 [2025-01-09 21:30:29,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:29,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:29,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:29,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:29,835 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:29,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2025-01-09 21:30:31,067 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73c43c4ee/54a5c5ea075a4d3eba6e832b564baddc/FLAG2bf503cc0 [2025-01-09 21:30:31,336 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:31,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2025-01-09 21:30:31,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73c43c4ee/54a5c5ea075a4d3eba6e832b564baddc/FLAG2bf503cc0 [2025-01-09 21:30:31,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73c43c4ee/54a5c5ea075a4d3eba6e832b564baddc [2025-01-09 21:30:31,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:31,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:31,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:31,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:31,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:31,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b61bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31, skipping insertion in model container [2025-01-09 21:30:31,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:31,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:31,886 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:31,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:31,926 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:31,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31 WrapperNode [2025-01-09 21:30:31,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:31,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:31,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:31,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:31,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,959 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 308 [2025-01-09 21:30:31,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:31,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:31,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:31,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:31,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:31,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:31,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:31,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:31,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (1/1) ... [2025-01-09 21:30:31,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:32,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:32,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:30:32,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:30:32,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:32,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:32,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:32,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:32,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:32,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:30:32,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:30:32,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:32,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:32,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:32,050 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:32,144 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:32,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:32,433 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:32,434 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:32,453 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:32,453 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:32,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:32 BoogieIcfgContainer [2025-01-09 21:30:32,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:32,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:32,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:32,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:32,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:31" (1/3) ... [2025-01-09 21:30:32,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429a8915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:32, skipping insertion in model container [2025-01-09 21:30:32,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:31" (2/3) ... [2025-01-09 21:30:32,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@429a8915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:32, skipping insertion in model container [2025-01-09 21:30:32,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:32" (3/3) ... [2025-01-09 21:30:32,463 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2025-01-09 21:30:32,473 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:32,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-subst.wvr.c that has 4 procedures, 392 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-01-09 21:30:32,474 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:32,549 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:30:32,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 412 transitions, 845 flow [2025-01-09 21:30:32,732 INFO L124 PetriNetUnfolderBase]: 21/409 cut-off events. [2025-01-09 21:30:32,737 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:32,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 409 events. 21/409 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1065 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 283. Up to 2 conditions per place. [2025-01-09 21:30:32,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 412 transitions, 845 flow [2025-01-09 21:30:32,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 389 transitions, 796 flow [2025-01-09 21:30:32,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:32,794 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;@4c657f93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:32,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-01-09 21:30:32,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:32,799 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-01-09 21:30:32,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:32,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,800 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:30:32,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:32,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash 795979492, now seen corresponding path program 1 times [2025-01-09 21:30:32,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348942485] [2025-01-09 21:30:32,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:30:32,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:30:32,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:32,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348942485] [2025-01-09 21:30:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348942485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058101367] [2025-01-09 21:30:32,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:33,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-01-09 21:30:33,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 389 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:33,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-01-09 21:30:33,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:33,155 INFO L124 PetriNetUnfolderBase]: 35/716 cut-off events. [2025-01-09 21:30:33,156 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-01-09 21:30:33,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 716 events. 35/716 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3261 event pairs, 7 based on Foata normal form. 23/617 useless extension candidates. Maximal degree in co-relation 608. Up to 25 conditions per place. [2025-01-09 21:30:33,165 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 11 selfloop transitions, 2 changer transitions 1/381 dead transitions. [2025-01-09 21:30:33,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 381 transitions, 806 flow [2025-01-09 21:30:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-01-09 21:30:33,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-01-09 21:30:33,181 INFO L175 Difference]: Start difference. First operand has 380 places, 389 transitions, 796 flow. Second operand 3 states and 1185 transitions. [2025-01-09 21:30:33,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 381 transitions, 806 flow [2025-01-09 21:30:33,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 381 transitions, 794 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:33,192 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 770 flow [2025-01-09 21:30:33,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2025-01-09 21:30:33,197 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -5 predicate places. [2025-01-09 21:30:33,198 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 770 flow [2025-01-09 21:30:33,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:33,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:33,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:33,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:33,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash 213531984, now seen corresponding path program 1 times [2025-01-09 21:30:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:33,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308851512] [2025-01-09 21:30:33,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:33,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:33,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:30:33,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:30:33,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:33,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:33,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:33,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308851512] [2025-01-09 21:30:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308851512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:33,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:33,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:33,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147507143] [2025-01-09 21:30:33,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:33,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:33,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:33,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:33,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:33,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-01-09 21:30:33,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:33,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-01-09 21:30:33,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:33,352 INFO L124 PetriNetUnfolderBase]: 25/551 cut-off events. [2025-01-09 21:30:33,353 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:33,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 551 events. 25/551 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2196 event pairs, 5 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 547. Up to 22 conditions per place. [2025-01-09 21:30:33,358 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-01-09 21:30:33,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 794 flow [2025-01-09 21:30:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-01-09 21:30:33,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-01-09 21:30:33,362 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 770 flow. Second operand 3 states and 1178 transitions. [2025-01-09 21:30:33,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 794 flow [2025-01-09 21:30:33,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:33,386 INFO L231 Difference]: Finished difference. Result has 373 places, 379 transitions, 768 flow [2025-01-09 21:30:33,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=373, PETRI_TRANSITIONS=379} [2025-01-09 21:30:33,387 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2025-01-09 21:30:33,387 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 379 transitions, 768 flow [2025-01-09 21:30:33,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:33,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:33,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:33,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:33,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash -144288898, now seen corresponding path program 1 times [2025-01-09 21:30:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:33,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592070512] [2025-01-09 21:30:33,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:33,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:33,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:30:33,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:30:33,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:33,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:33,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:33,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592070512] [2025-01-09 21:30:33,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592070512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:33,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944157170] [2025-01-09 21:30:33,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:33,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:33,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:33,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:33,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:33,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-01-09 21:30:33,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 379 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:33,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-01-09 21:30:33,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:33,490 INFO L124 PetriNetUnfolderBase]: 23/470 cut-off events. [2025-01-09 21:30:33,491 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:30:33,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 470 events. 23/470 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1661 event pairs, 7 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 460. Up to 25 conditions per place. [2025-01-09 21:30:33,498 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-01-09 21:30:33,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 378 transitions, 792 flow [2025-01-09 21:30:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-01-09 21:30:33,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-01-09 21:30:33,500 INFO L175 Difference]: Start difference. First operand has 373 places, 379 transitions, 768 flow. Second operand 3 states and 1178 transitions. [2025-01-09 21:30:33,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 378 transitions, 792 flow [2025-01-09 21:30:33,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 378 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:33,504 INFO L231 Difference]: Finished difference. Result has 372 places, 378 transitions, 766 flow [2025-01-09 21:30:33,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=372, PETRI_TRANSITIONS=378} [2025-01-09 21:30:33,505 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -8 predicate places. [2025-01-09 21:30:33,506 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 378 transitions, 766 flow [2025-01-09 21:30:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:33,506 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] [2025-01-09 21:30:33,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:33,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:33,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1587522512, now seen corresponding path program 1 times [2025-01-09 21:30:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780616206] [2025-01-09 21:30:33,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:33,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:33,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:30:33,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:30:33,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:33,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:33,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:33,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780616206] [2025-01-09 21:30:33,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780616206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:33,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:33,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:33,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298819135] [2025-01-09 21:30:33,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:33,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:33,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:33,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:33,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:33,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-01-09 21:30:33,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 378 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:33,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-01-09 21:30:33,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:33,688 INFO L124 PetriNetUnfolderBase]: 43/846 cut-off events. [2025-01-09 21:30:33,688 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:33,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 846 events. 43/846 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4599 event pairs, 7 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 831. Up to 25 conditions per place. [2025-01-09 21:30:33,697 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-01-09 21:30:33,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 377 transitions, 790 flow [2025-01-09 21:30:33,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-01-09 21:30:33,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-01-09 21:30:33,700 INFO L175 Difference]: Start difference. First operand has 372 places, 378 transitions, 766 flow. Second operand 3 states and 1178 transitions. [2025-01-09 21:30:33,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 377 transitions, 790 flow [2025-01-09 21:30:33,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 377 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:33,705 INFO L231 Difference]: Finished difference. Result has 371 places, 377 transitions, 764 flow [2025-01-09 21:30:33,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=371, PETRI_TRANSITIONS=377} [2025-01-09 21:30:33,706 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2025-01-09 21:30:33,706 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 377 transitions, 764 flow [2025-01-09 21:30:33,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:33,707 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] [2025-01-09 21:30:33,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:33,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:33,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:33,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1746765296, now seen corresponding path program 1 times [2025-01-09 21:30:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:33,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180928885] [2025-01-09 21:30:33,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:33,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:33,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:30:33,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:30:33,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:33,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:33,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:30:33,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:33,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180928885] [2025-01-09 21:30:33,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180928885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:33,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:33,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202990592] [2025-01-09 21:30:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:33,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:33,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:33,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:33,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:33,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-01-09 21:30:33,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 377 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:33,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-01-09 21:30:33,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:33,850 INFO L124 PetriNetUnfolderBase]: 32/602 cut-off events. [2025-01-09 21:30:33,850 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:33,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 602 events. 32/602 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2760 event pairs, 8 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 583. Up to 29 conditions per place. [2025-01-09 21:30:33,858 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-01-09 21:30:33,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 376 transitions, 790 flow [2025-01-09 21:30:33,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2025-01-09 21:30:33,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2025-01-09 21:30:33,862 INFO L175 Difference]: Start difference. First operand has 371 places, 377 transitions, 764 flow. Second operand 3 states and 1176 transitions. [2025-01-09 21:30:33,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 376 transitions, 790 flow [2025-01-09 21:30:33,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 376 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:33,868 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 762 flow [2025-01-09 21:30:33,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=370, PETRI_TRANSITIONS=376} [2025-01-09 21:30:33,872 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2025-01-09 21:30:33,872 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 762 flow [2025-01-09 21:30:33,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:33,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:33,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:33,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:33,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:33,874 INFO L85 PathProgramCache]: Analyzing trace with hash 639497774, now seen corresponding path program 1 times [2025-01-09 21:30:33,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:33,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866294060] [2025-01-09 21:30:33,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:33,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:33,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:30:33,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:30:33,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:33,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:33,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:33,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866294060] [2025-01-09 21:30:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866294060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:33,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096182212] [2025-01-09 21:30:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:33,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:33,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:33,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:33,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:33,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2025-01-09 21:30:33,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 376 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:33,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:33,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2025-01-09 21:30:33,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,065 INFO L124 PetriNetUnfolderBase]: 64/971 cut-off events. [2025-01-09 21:30:34,065 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-01-09 21:30:34,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 971 events. 64/971 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5214 event pairs, 20 based on Foata normal form. 0/809 useless extension candidates. Maximal degree in co-relation 963. Up to 50 conditions per place. [2025-01-09 21:30:34,076 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-01-09 21:30:34,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 375 transitions, 790 flow [2025-01-09 21:30:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2025-01-09 21:30:34,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2025-01-09 21:30:34,079 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 762 flow. Second operand 3 states and 1174 transitions. [2025-01-09 21:30:34,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 375 transitions, 790 flow [2025-01-09 21:30:34,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 375 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:34,084 INFO L231 Difference]: Finished difference. Result has 369 places, 375 transitions, 760 flow [2025-01-09 21:30:34,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=369, PETRI_TRANSITIONS=375} [2025-01-09 21:30:34,085 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2025-01-09 21:30:34,085 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 375 transitions, 760 flow [2025-01-09 21:30:34,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:34,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:34,086 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:34,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,087 INFO L85 PathProgramCache]: Analyzing trace with hash -447938175, now seen corresponding path program 1 times [2025-01-09 21:30:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845286895] [2025-01-09 21:30:34,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 21:30:34,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 21:30:34,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:34,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845286895] [2025-01-09 21:30:34,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845286895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458676180] [2025-01-09 21:30:34,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-01-09 21:30:34,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 375 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-01-09 21:30:34,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,248 INFO L124 PetriNetUnfolderBase]: 35/709 cut-off events. [2025-01-09 21:30:34,248 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-01-09 21:30:34,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 709 events. 35/709 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3503 event pairs, 7 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 670. Up to 25 conditions per place. [2025-01-09 21:30:34,260 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-01-09 21:30:34,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 374 transitions, 784 flow [2025-01-09 21:30:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-01-09 21:30:34,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-01-09 21:30:34,262 INFO L175 Difference]: Start difference. First operand has 369 places, 375 transitions, 760 flow. Second operand 3 states and 1178 transitions. [2025-01-09 21:30:34,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 374 transitions, 784 flow [2025-01-09 21:30:34,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:34,267 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 758 flow [2025-01-09 21:30:34,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2025-01-09 21:30:34,267 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2025-01-09 21:30:34,268 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 758 flow [2025-01-09 21:30:34,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,268 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] [2025-01-09 21:30:34,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:34,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:34,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1577847982, now seen corresponding path program 1 times [2025-01-09 21:30:34,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984732588] [2025-01-09 21:30:34,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:30:34,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:30:34,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:34,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984732588] [2025-01-09 21:30:34,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984732588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705596206] [2025-01-09 21:30:34,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-01-09 21:30:34,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-01-09 21:30:34,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,384 INFO L124 PetriNetUnfolderBase]: 36/713 cut-off events. [2025-01-09 21:30:34,385 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:34,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 713 events. 36/713 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3722 event pairs, 8 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 670. Up to 29 conditions per place. [2025-01-09 21:30:34,392 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-01-09 21:30:34,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 784 flow [2025-01-09 21:30:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2025-01-09 21:30:34,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2025-01-09 21:30:34,394 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 758 flow. Second operand 3 states and 1176 transitions. [2025-01-09 21:30:34,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 784 flow [2025-01-09 21:30:34,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:34,398 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 756 flow [2025-01-09 21:30:34,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2025-01-09 21:30:34,399 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2025-01-09 21:30:34,399 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 756 flow [2025-01-09 21:30:34,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,400 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] [2025-01-09 21:30:34,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:34,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:34,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1051413800, now seen corresponding path program 1 times [2025-01-09 21:30:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416299293] [2025-01-09 21:30:34,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:30:34,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:30:34,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:34,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416299293] [2025-01-09 21:30:34,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416299293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474063584] [2025-01-09 21:30:34,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2025-01-09 21:30:34,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2025-01-09 21:30:34,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,564 INFO L124 PetriNetUnfolderBase]: 40/564 cut-off events. [2025-01-09 21:30:34,564 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2025-01-09 21:30:34,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 564 events. 40/564 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2627 event pairs, 20 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 532. Up to 50 conditions per place. [2025-01-09 21:30:34,570 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-01-09 21:30:34,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 784 flow [2025-01-09 21:30:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2025-01-09 21:30:34,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2025-01-09 21:30:34,572 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 756 flow. Second operand 3 states and 1174 transitions. [2025-01-09 21:30:34,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 784 flow [2025-01-09 21:30:34,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:34,576 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 754 flow [2025-01-09 21:30:34,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2025-01-09 21:30:34,578 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-01-09 21:30:34,578 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 754 flow [2025-01-09 21:30:34,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,578 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] [2025-01-09 21:30:34,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:34,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:34,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1398066235, now seen corresponding path program 1 times [2025-01-09 21:30:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128056220] [2025-01-09 21:30:34,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:30:34,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:30:34,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:34,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128056220] [2025-01-09 21:30:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128056220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795171803] [2025-01-09 21:30:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-01-09 21:30:34,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-01-09 21:30:34,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,740 INFO L124 PetriNetUnfolderBase]: 76/1238 cut-off events. [2025-01-09 21:30:34,741 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:30:34,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1238 events. 76/1238 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8585 event pairs, 13 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1202. Up to 43 conditions per place. [2025-01-09 21:30:34,752 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-01-09 21:30:34,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 374 transitions, 790 flow [2025-01-09 21:30:34,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2025-01-09 21:30:34,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2025-01-09 21:30:34,754 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 754 flow. Second operand 3 states and 1187 transitions. [2025-01-09 21:30:34,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 374 transitions, 790 flow [2025-01-09 21:30:34,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:34,758 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 760 flow [2025-01-09 21:30:34,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2025-01-09 21:30:34,759 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-01-09 21:30:34,759 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 760 flow [2025-01-09 21:30:34,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,760 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] [2025-01-09 21:30:34,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:34,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:34,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1492401106, now seen corresponding path program 1 times [2025-01-09 21:30:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185179334] [2025-01-09 21:30:34,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:30:34,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:30:34,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:34,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185179334] [2025-01-09 21:30:34,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185179334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703695403] [2025-01-09 21:30:34,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-01-09 21:30:34,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-01-09 21:30:34,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:34,901 INFO L124 PetriNetUnfolderBase]: 69/1058 cut-off events. [2025-01-09 21:30:34,902 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:30:34,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 1058 events. 69/1058 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6756 event pairs, 10 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 942. Up to 49 conditions per place. [2025-01-09 21:30:34,916 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 15 selfloop transitions, 3 changer transitions 0/374 dead transitions. [2025-01-09 21:30:34,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 374 transitions, 802 flow [2025-01-09 21:30:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-01-09 21:30:34,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2025-01-09 21:30:34,918 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 760 flow. Second operand 3 states and 1182 transitions. [2025-01-09 21:30:34,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 374 transitions, 802 flow [2025-01-09 21:30:34,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:34,922 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 775 flow [2025-01-09 21:30:34,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2025-01-09 21:30:34,923 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-01-09 21:30:34,923 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 775 flow [2025-01-09 21:30:34,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:34,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:34,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:34,924 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:34,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:34,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1381044782, now seen corresponding path program 1 times [2025-01-09 21:30:34,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:34,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677661500] [2025-01-09 21:30:34,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:34,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:34,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:30:34,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:30:34,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:34,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677661500] [2025-01-09 21:30:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677661500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:34,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:34,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:34,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260252171] [2025-01-09 21:30:34,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:34,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:34,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:34,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:34,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:34,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-01-09 21:30:34,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:34,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:34,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-01-09 21:30:34,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,098 INFO L124 PetriNetUnfolderBase]: 70/1296 cut-off events. [2025-01-09 21:30:35,098 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2025-01-09 21:30:35,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 1296 events. 70/1296 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9339 event pairs, 4 based on Foata normal form. 1/1110 useless extension candidates. Maximal degree in co-relation 1117. Up to 53 conditions per place. [2025-01-09 21:30:35,113 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-01-09 21:30:35,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 377 transitions, 826 flow [2025-01-09 21:30:35,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-01-09 21:30:35,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2025-01-09 21:30:35,115 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 775 flow. Second operand 3 states and 1190 transitions. [2025-01-09 21:30:35,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 377 transitions, 826 flow [2025-01-09 21:30:35,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 377 transitions, 826 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:35,119 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 785 flow [2025-01-09 21:30:35,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2025-01-09 21:30:35,120 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-01-09 21:30:35,120 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 785 flow [2025-01-09 21:30:35,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:35,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:35,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:35,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:35,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1644657233, now seen corresponding path program 1 times [2025-01-09 21:30:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670934070] [2025-01-09 21:30:35,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:30:35,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:30:35,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670934070] [2025-01-09 21:30:35,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670934070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955444069] [2025-01-09 21:30:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 412 [2025-01-09 21:30:35,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:35,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 412 [2025-01-09 21:30:35,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,261 INFO L124 PetriNetUnfolderBase]: 57/1056 cut-off events. [2025-01-09 21:30:35,262 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES. [2025-01-09 21:30:35,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 1056 events. 57/1056 cut-off events. For 4/20 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6850 event pairs, 8 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 957. Up to 32 conditions per place. [2025-01-09 21:30:35,275 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-01-09 21:30:35,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 373 transitions, 815 flow [2025-01-09 21:30:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2025-01-09 21:30:35,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2025-01-09 21:30:35,277 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 785 flow. Second operand 3 states and 1187 transitions. [2025-01-09 21:30:35,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 373 transitions, 815 flow [2025-01-09 21:30:35,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:35,281 INFO L231 Difference]: Finished difference. Result has 367 places, 371 transitions, 787 flow [2025-01-09 21:30:35,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=367, PETRI_TRANSITIONS=371} [2025-01-09 21:30:35,282 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2025-01-09 21:30:35,282 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 371 transitions, 787 flow [2025-01-09 21:30:35,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:35,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:35,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:35,283 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:35,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash -375103681, now seen corresponding path program 1 times [2025-01-09 21:30:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142553604] [2025-01-09 21:30:35,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:30:35,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:30:35,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:35,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142553604] [2025-01-09 21:30:35,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142553604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574369205] [2025-01-09 21:30:35,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2025-01-09 21:30:35,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 371 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:35,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2025-01-09 21:30:35,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:35,645 INFO L124 PetriNetUnfolderBase]: 344/3908 cut-off events. [2025-01-09 21:30:35,645 INFO L125 PetriNetUnfolderBase]: For 62/74 co-relation queries the response was YES. [2025-01-09 21:30:35,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 3908 events. 344/3908 cut-off events. For 62/74 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 40513 event pairs, 96 based on Foata normal form. 0/3321 useless extension candidates. Maximal degree in co-relation 3500. Up to 312 conditions per place. [2025-01-09 21:30:35,666 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 17 selfloop transitions, 4 changer transitions 0/373 dead transitions. [2025-01-09 21:30:35,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 373 transitions, 835 flow [2025-01-09 21:30:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1177 transitions. [2025-01-09 21:30:35,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522653721682848 [2025-01-09 21:30:35,670 INFO L175 Difference]: Start difference. First operand has 367 places, 371 transitions, 787 flow. Second operand 3 states and 1177 transitions. [2025-01-09 21:30:35,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 373 transitions, 835 flow [2025-01-09 21:30:35,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 373 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:35,674 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 803 flow [2025-01-09 21:30:35,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=803, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2025-01-09 21:30:35,675 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-01-09 21:30:35,675 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 803 flow [2025-01-09 21:30:35,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:35,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:35,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:35,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:35,676 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:35,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1214327577, now seen corresponding path program 1 times [2025-01-09 21:30:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:35,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215689935] [2025-01-09 21:30:35,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:35,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:30:35,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:30:35,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:35,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:35,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:35,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215689935] [2025-01-09 21:30:35,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215689935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:35,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:35,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:35,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714990774] [2025-01-09 21:30:35,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:35,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:35,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:35,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:35,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:35,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-01-09 21:30:35,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:35,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:35,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-01-09 21:30:35,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,062 INFO L124 PetriNetUnfolderBase]: 167/2950 cut-off events. [2025-01-09 21:30:36,062 INFO L125 PetriNetUnfolderBase]: For 23/34 co-relation queries the response was YES. [2025-01-09 21:30:36,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 2950 events. 167/2950 cut-off events. For 23/34 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 27821 event pairs, 20 based on Foata normal form. 1/2540 useless extension candidates. Maximal degree in co-relation 2794. Up to 133 conditions per place. [2025-01-09 21:30:36,080 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 18 selfloop transitions, 3 changer transitions 0/376 dead transitions. [2025-01-09 21:30:36,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 376 transitions, 860 flow [2025-01-09 21:30:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-01-09 21:30:36,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-01-09 21:30:36,083 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 803 flow. Second operand 3 states and 1185 transitions. [2025-01-09 21:30:36,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 376 transitions, 860 flow [2025-01-09 21:30:36,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 376 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,086 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 818 flow [2025-01-09 21:30:36,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2025-01-09 21:30:36,087 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-01-09 21:30:36,087 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 818 flow [2025-01-09 21:30:36,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:36,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:36,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:36,089 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:36,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash -475719494, now seen corresponding path program 1 times [2025-01-09 21:30:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089259931] [2025-01-09 21:30:36,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:30:36,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:30:36,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089259931] [2025-01-09 21:30:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089259931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808685327] [2025-01-09 21:30:36,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-01-09 21:30:36,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:36,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-01-09 21:30:36,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,367 INFO L124 PetriNetUnfolderBase]: 114/2582 cut-off events. [2025-01-09 21:30:36,367 INFO L125 PetriNetUnfolderBase]: For 12/18 co-relation queries the response was YES. [2025-01-09 21:30:36,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 2582 events. 114/2582 cut-off events. For 12/18 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 23033 event pairs, 4 based on Foata normal form. 0/2258 useless extension candidates. Maximal degree in co-relation 2341. Up to 68 conditions per place. [2025-01-09 21:30:36,399 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-01-09 21:30:36,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 376 transitions, 869 flow [2025-01-09 21:30:36,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-01-09 21:30:36,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2025-01-09 21:30:36,401 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 818 flow. Second operand 3 states and 1190 transitions. [2025-01-09 21:30:36,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 376 transitions, 869 flow [2025-01-09 21:30:36,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 376 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,405 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 828 flow [2025-01-09 21:30:36,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2025-01-09 21:30:36,406 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-01-09 21:30:36,406 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 828 flow [2025-01-09 21:30:36,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:36,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:36,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:36,407 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:36,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1624830416, now seen corresponding path program 1 times [2025-01-09 21:30:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683794103] [2025-01-09 21:30:36,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:30:36,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:30:36,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:36,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683794103] [2025-01-09 21:30:36,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683794103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453670197] [2025-01-09 21:30:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-01-09 21:30:36,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:36,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-01-09 21:30:36,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:36,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1006] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~nondet12#1][173], [437#(= |#race~is_null_3~0| 0), 139#L50-40true, Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:36,723 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-01-09 21:30:36,723 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:36,723 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-01-09 21:30:36,723 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-01-09 21:30:36,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][225], [437#(= |#race~is_null_3~0| 0), 139#L50-40true, Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:36,743 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-01-09 21:30:36,743 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:30:36,743 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-01-09 21:30:36,743 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:30:36,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][265], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 460#(= |#race~result_10~0| |thread2Thread1of1ForFork2_#t~nondet12#1|), Black: 431#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L50-41true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:36,744 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:30:36,744 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-01-09 21:30:36,744 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-01-09 21:30:36,744 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-01-09 21:30:36,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][265], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 387#L50-42true, 460#(= |#race~result_10~0| |thread2Thread1of1ForFork2_#t~nondet12#1|), Black: 431#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:36,747 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-01-09 21:30:36,747 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:30:36,747 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2025-01-09 21:30:36,747 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:30:36,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][225], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 100#L52true, Black: 431#true, 458#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:36,760 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:30:36,760 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:30:36,760 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-01-09 21:30:36,760 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-01-09 21:30:36,835 INFO L124 PetriNetUnfolderBase]: 227/3804 cut-off events. [2025-01-09 21:30:36,835 INFO L125 PetriNetUnfolderBase]: For 44/113 co-relation queries the response was YES. [2025-01-09 21:30:36,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 3804 events. 227/3804 cut-off events. For 44/113 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 36952 event pairs, 28 based on Foata normal form. 1/3299 useless extension candidates. Maximal degree in co-relation 3487. Up to 120 conditions per place. [2025-01-09 21:30:36,857 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-01-09 21:30:36,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 372 transitions, 860 flow [2025-01-09 21:30:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-01-09 21:30:36,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-01-09 21:30:36,861 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 828 flow. Second operand 3 states and 1185 transitions. [2025-01-09 21:30:36,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 372 transitions, 860 flow [2025-01-09 21:30:36,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:36,866 INFO L231 Difference]: Finished difference. Result has 366 places, 370 transitions, 830 flow [2025-01-09 21:30:36,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=366, PETRI_TRANSITIONS=370} [2025-01-09 21:30:36,867 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-01-09 21:30:36,867 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 370 transitions, 830 flow [2025-01-09 21:30:36,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:36,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:36,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:36,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:30:36,868 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:36,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:36,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1899868835, now seen corresponding path program 1 times [2025-01-09 21:30:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:36,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890629663] [2025-01-09 21:30:36,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:36,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:36,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:30:36,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:30:36,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:36,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:36,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:36,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890629663] [2025-01-09 21:30:36,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890629663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:36,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:36,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:36,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324129834] [2025-01-09 21:30:36,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:36,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:36,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:36,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:36,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-01-09 21:30:36,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 370 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:36,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:36,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-01-09 21:30:36,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:37,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= 0 |#race~filename_is_null_5~0|), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), 299#L56-25true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:37,225 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2025-01-09 21:30:37,225 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-01-09 21:30:37,225 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-01-09 21:30:37,226 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-01-09 21:30:37,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= 0 |#race~filename_is_null_5~0|), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), 193#L56-26true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:37,230 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-01-09 21:30:37,230 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-01-09 21:30:37,230 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-01-09 21:30:37,230 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-01-09 21:30:37,248 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), 299#L56-25true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:37,248 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2025-01-09 21:30:37,248 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2025-01-09 21:30:37,248 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2025-01-09 21:30:37,248 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-01-09 21:30:37,248 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2025-01-09 21:30:37,249 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), 193#L56-26true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:37,249 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is not cut-off event [2025-01-09 21:30:37,249 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is not cut-off event [2025-01-09 21:30:37,249 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2025-01-09 21:30:37,249 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2025-01-09 21:30:37,249 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is not cut-off event [2025-01-09 21:30:37,269 INFO L124 PetriNetUnfolderBase]: 126/3370 cut-off events. [2025-01-09 21:30:37,270 INFO L125 PetriNetUnfolderBase]: For 43/80 co-relation queries the response was YES. [2025-01-09 21:30:37,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3690 conditions, 3370 events. 126/3370 cut-off events. For 43/80 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 30759 event pairs, 14 based on Foata normal form. 2/3002 useless extension candidates. Maximal degree in co-relation 3242. Up to 140 conditions per place. [2025-01-09 21:30:37,297 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-01-09 21:30:37,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 375 transitions, 881 flow [2025-01-09 21:30:37,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-01-09 21:30:37,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2025-01-09 21:30:37,301 INFO L175 Difference]: Start difference. First operand has 366 places, 370 transitions, 830 flow. Second operand 3 states and 1190 transitions. [2025-01-09 21:30:37,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 375 transitions, 881 flow [2025-01-09 21:30:37,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 375 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:37,305 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 836 flow [2025-01-09 21:30:37,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=365, PETRI_TRANSITIONS=370} [2025-01-09 21:30:37,306 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-01-09 21:30:37,306 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 836 flow [2025-01-09 21:30:37,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:37,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:37,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:37,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:37,307 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:37,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1355541654, now seen corresponding path program 1 times [2025-01-09 21:30:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:37,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905512837] [2025-01-09 21:30:37,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:37,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 21:30:37,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 21:30:37,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:37,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:37,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905512837] [2025-01-09 21:30:37,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905512837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:37,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:37,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:37,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342624216] [2025-01-09 21:30:37,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:37,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:37,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:37,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:37,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2025-01-09 21:30:37,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 370 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:37,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:37,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2025-01-09 21:30:37,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:38,227 INFO L124 PetriNetUnfolderBase]: 456/7770 cut-off events. [2025-01-09 21:30:38,228 INFO L125 PetriNetUnfolderBase]: For 134/150 co-relation queries the response was YES. [2025-01-09 21:30:38,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8736 conditions, 7770 events. 456/7770 cut-off events. For 134/150 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 92500 event pairs, 76 based on Foata normal form. 2/7022 useless extension candidates. Maximal degree in co-relation 7734. Up to 616 conditions per place. [2025-01-09 21:30:38,270 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 19 selfloop transitions, 4 changer transitions 0/374 dead transitions. [2025-01-09 21:30:38,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 374 transitions, 894 flow [2025-01-09 21:30:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2025-01-09 21:30:38,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9538834951456311 [2025-01-09 21:30:38,272 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 836 flow. Second operand 3 states and 1179 transitions. [2025-01-09 21:30:38,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 374 transitions, 894 flow [2025-01-09 21:30:38,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 374 transitions, 894 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:38,276 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 856 flow [2025-01-09 21:30:38,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2025-01-09 21:30:38,277 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-01-09 21:30:38,277 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 856 flow [2025-01-09 21:30:38,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:38,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:38,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:38,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:38,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:38,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash 136961259, now seen corresponding path program 1 times [2025-01-09 21:30:38,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:38,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112439704] [2025-01-09 21:30:38,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:38,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:38,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:38,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:38,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:38,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:38,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112439704] [2025-01-09 21:30:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112439704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:38,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:38,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454468467] [2025-01-09 21:30:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:38,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:38,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:38,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:38,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-01-09 21:30:38,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:38,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:38,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-01-09 21:30:38,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:38,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,607 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-01-09 21:30:38,607 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-01-09 21:30:38,607 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-01-09 21:30:38,607 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-01-09 21:30:38,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,648 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-01-09 21:30:38,648 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:38,648 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,648 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,648 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,649 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,649 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,649 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,649 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:38,649 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,650 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,650 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:38,650 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:38,650 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,650 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-01-09 21:30:38,650 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:38,650 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,650 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-01-09 21:30:38,651 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:38,651 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:38,651 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-01-09 21:30:38,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,652 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-01-09 21:30:38,652 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:38,652 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:38,652 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-01-09 21:30:38,653 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,653 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-01-09 21:30:38,653 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:38,653 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:38,653 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:38,653 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-01-09 21:30:38,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 98#L56-42true, Black: 439#true, 46#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,655 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2025-01-09 21:30:38,655 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:38,655 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:30:38,655 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:38,655 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 98#L56-42true, Black: 439#true, 46#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,655 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2025-01-09 21:30:38,655 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:38,655 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:30:38,656 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-01-09 21:30:38,656 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:38,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 45#L58true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,660 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-01-09 21:30:38,660 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:38,660 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:38,661 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:38,661 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 45#L58true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,661 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2025-01-09 21:30:38,661 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:38,661 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-01-09 21:30:38,661 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-01-09 21:30:38,661 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:38,662 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,662 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is not cut-off event [2025-01-09 21:30:38,662 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2025-01-09 21:30:38,662 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-01-09 21:30:38,662 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-01-09 21:30:38,662 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2025-01-09 21:30:38,662 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2025-01-09 21:30:38,662 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,662 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2025-01-09 21:30:38,662 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:38,662 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:38,662 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:38,662 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-01-09 21:30:38,662 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-01-09 21:30:38,663 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, 98#L56-42true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,663 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-01-09 21:30:38,663 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:38,664 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-01-09 21:30:38,664 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-01-09 21:30:38,664 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2025-01-09 21:30:38,664 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-01-09 21:30:38,667 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 45#L58true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:38,667 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is not cut-off event [2025-01-09 21:30:38,667 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-01-09 21:30:38,667 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is not cut-off event [2025-01-09 21:30:38,667 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-01-09 21:30:38,667 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-01-09 21:30:38,667 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2025-01-09 21:30:38,675 INFO L124 PetriNetUnfolderBase]: 368/4189 cut-off events. [2025-01-09 21:30:38,675 INFO L125 PetriNetUnfolderBase]: For 239/376 co-relation queries the response was YES. [2025-01-09 21:30:38,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5318 conditions, 4189 events. 368/4189 cut-off events. For 239/376 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 43461 event pairs, 82 based on Foata normal form. 2/3815 useless extension candidates. Maximal degree in co-relation 4684. Up to 427 conditions per place. [2025-01-09 21:30:38,718 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-01-09 21:30:38,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 371 transitions, 888 flow [2025-01-09 21:30:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-01-09 21:30:38,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-01-09 21:30:38,721 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 856 flow. Second operand 3 states and 1185 transitions. [2025-01-09 21:30:38,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 371 transitions, 888 flow [2025-01-09 21:30:38,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:38,725 INFO L231 Difference]: Finished difference. Result has 365 places, 369 transitions, 858 flow [2025-01-09 21:30:38,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=365, PETRI_TRANSITIONS=369} [2025-01-09 21:30:38,725 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-01-09 21:30:38,725 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 369 transitions, 858 flow [2025-01-09 21:30:38,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:38,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:38,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:38,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:38,726 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:38,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash 239459324, now seen corresponding path program 1 times [2025-01-09 21:30:38,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:38,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30256800] [2025-01-09 21:30:38,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:38,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:38,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:38,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:38,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:38,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30256800] [2025-01-09 21:30:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30256800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:38,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:38,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:38,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348367115] [2025-01-09 21:30:38,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:38,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:38,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:38,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:38,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-01-09 21:30:38,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 369 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:38,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:38,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-01-09 21:30:38,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:39,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][348], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 104#L80true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 472#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:39,164 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2025-01-09 21:30:39,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-01-09 21:30:39,164 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-01-09 21:30:39,164 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-01-09 21:30:39,226 INFO L124 PetriNetUnfolderBase]: 240/5812 cut-off events. [2025-01-09 21:30:39,226 INFO L125 PetriNetUnfolderBase]: For 70/80 co-relation queries the response was YES. [2025-01-09 21:30:39,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6721 conditions, 5812 events. 240/5812 cut-off events. For 70/80 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 62759 event pairs, 20 based on Foata normal form. 0/5413 useless extension candidates. Maximal degree in co-relation 5910. Up to 300 conditions per place. [2025-01-09 21:30:39,281 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 15 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-01-09 21:30:39,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 373 transitions, 904 flow [2025-01-09 21:30:39,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2025-01-09 21:30:39,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2025-01-09 21:30:39,284 INFO L175 Difference]: Start difference. First operand has 365 places, 369 transitions, 858 flow. Second operand 3 states and 1189 transitions. [2025-01-09 21:30:39,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 373 transitions, 904 flow [2025-01-09 21:30:39,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 373 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:39,292 INFO L231 Difference]: Finished difference. Result has 364 places, 369 transitions, 864 flow [2025-01-09 21:30:39,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=364, PETRI_TRANSITIONS=369} [2025-01-09 21:30:39,293 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-01-09 21:30:39,293 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 369 transitions, 864 flow [2025-01-09 21:30:39,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:39,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:39,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:39,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:30:39,294 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:39,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1141967850, now seen corresponding path program 1 times [2025-01-09 21:30:39,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:39,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784546237] [2025-01-09 21:30:39,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:39,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:39,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 21:30:39,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 21:30:39,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:39,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:39,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:39,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784546237] [2025-01-09 21:30:39,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784546237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:39,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070736492] [2025-01-09 21:30:39,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:39,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:39,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:39,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:39,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 412 [2025-01-09 21:30:39,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 369 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:39,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:39,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 412 [2025-01-09 21:30:39,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:39,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 104#L80true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, Black: 472#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:39,741 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-01-09 21:30:39,741 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:39,741 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:39,741 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-01-09 21:30:39,744 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1156] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 104#L80true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, Black: 472#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:39,744 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2025-01-09 21:30:39,744 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:39,744 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-01-09 21:30:39,744 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-01-09 21:30:39,744 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:39,745 INFO L124 PetriNetUnfolderBase]: 193/5368 cut-off events. [2025-01-09 21:30:39,745 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES. [2025-01-09 21:30:39,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 5368 events. 193/5368 cut-off events. For 21/57 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 56682 event pairs, 6 based on Foata normal form. 0/5015 useless extension candidates. Maximal degree in co-relation 5455. Up to 147 conditions per place. [2025-01-09 21:30:39,787 INFO L140 encePairwiseOnDemand]: 410/412 looper letters, 8 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2025-01-09 21:30:39,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 368 transitions, 880 flow [2025-01-09 21:30:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2025-01-09 21:30:39,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2025-01-09 21:30:39,790 INFO L175 Difference]: Start difference. First operand has 364 places, 369 transitions, 864 flow. Second operand 3 states and 1189 transitions. [2025-01-09 21:30:39,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 368 transitions, 880 flow [2025-01-09 21:30:39,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 368 transitions, 880 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:39,793 INFO L231 Difference]: Finished difference. Result has 365 places, 368 transitions, 864 flow [2025-01-09 21:30:39,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=365, PETRI_TRANSITIONS=368} [2025-01-09 21:30:39,794 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-01-09 21:30:39,794 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 368 transitions, 864 flow [2025-01-09 21:30:39,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:39,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:39,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:39,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:39,795 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:39,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:39,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1800932855, now seen corresponding path program 1 times [2025-01-09 21:30:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:39,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83884575] [2025-01-09 21:30:39,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:39,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 21:30:39,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 21:30:39,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:39,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:39,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:30:39,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:39,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83884575] [2025-01-09 21:30:39,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83884575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:39,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:39,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:39,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597943534] [2025-01-09 21:30:39,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:39,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:39,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:39,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:39,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:39,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-01-09 21:30:39,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 368 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:39,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:39,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-01-09 21:30:39,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:40,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 104#L80true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, Black: 472#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:40,328 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-01-09 21:30:40,328 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-01-09 21:30:40,329 INFO L124 PetriNetUnfolderBase]: 199/5682 cut-off events. [2025-01-09 21:30:40,329 INFO L125 PetriNetUnfolderBase]: For 21/68 co-relation queries the response was YES. [2025-01-09 21:30:40,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6506 conditions, 5682 events. 199/5682 cut-off events. For 21/68 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 61200 event pairs, 18 based on Foata normal form. 0/5317 useless extension candidates. Maximal degree in co-relation 6206. Up to 166 conditions per place. [2025-01-09 21:30:40,363 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 10 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2025-01-09 21:30:40,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 366 transitions, 882 flow [2025-01-09 21:30:40,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1183 transitions. [2025-01-09 21:30:40,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571197411003236 [2025-01-09 21:30:40,366 INFO L175 Difference]: Start difference. First operand has 365 places, 368 transitions, 864 flow. Second operand 3 states and 1183 transitions. [2025-01-09 21:30:40,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 366 transitions, 882 flow [2025-01-09 21:30:40,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 366 transitions, 881 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:40,370 INFO L231 Difference]: Finished difference. Result has 364 places, 366 transitions, 861 flow [2025-01-09 21:30:40,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=364, PETRI_TRANSITIONS=366} [2025-01-09 21:30:40,371 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-01-09 21:30:40,371 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 366 transitions, 861 flow [2025-01-09 21:30:40,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:40,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:40,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:40,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:40,372 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:30:40,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:40,374 INFO L85 PathProgramCache]: Analyzing trace with hash -326767216, now seen corresponding path program 1 times [2025-01-09 21:30:40,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:40,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260398203] [2025-01-09 21:30:40,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:40,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 21:30:40,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 21:30:40,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:40,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260398203] [2025-01-09 21:30:40,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260398203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:40,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:40,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:40,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162057249] [2025-01-09 21:30:40,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:40,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:40,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:40,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:40,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:40,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-01-09 21:30:40,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 366 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:40,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:40,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-01-09 21:30:40,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:40,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 164#L56-41true, 479#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 472#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:40,716 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2025-01-09 21:30:40,716 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-01-09 21:30:40,716 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:30:40,716 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2025-01-09 21:30:40,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:40,757 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,757 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,757 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,757 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,768 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1090] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:40,768 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,768 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,768 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,768 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,768 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][302], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:40,769 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,769 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,769 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,769 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,769 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1090] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:40,769 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2025-01-09 21:30:40,769 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,769 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,769 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,769 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,769 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,770 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][302], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:40,770 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,770 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,770 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,770 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-01-09 21:30:40,770 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-01-09 21:30:40,772 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1090] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-01-09 21:30:40,772 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2025-01-09 21:30:40,772 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-01-09 21:30:40,772 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is not cut-off event [2025-01-09 21:30:40,772 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2025-01-09 21:30:40,772 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2025-01-09 21:30:40,772 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-01-09 21:30:40,772 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-01-09 21:30:40,774 INFO L124 PetriNetUnfolderBase]: 203/4061 cut-off events. [2025-01-09 21:30:40,774 INFO L125 PetriNetUnfolderBase]: For 63/114 co-relation queries the response was YES. [2025-01-09 21:30:40,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4815 conditions, 4061 events. 203/4061 cut-off events. For 63/114 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 41112 event pairs, 48 based on Foata normal form. 12/3785 useless extension candidates. Maximal degree in co-relation 4647. Up to 248 conditions per place. [2025-01-09 21:30:40,812 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2025-01-09 21:30:40,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 364 transitions, 877 flow [2025-01-09 21:30:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-01-09 21:30:40,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2025-01-09 21:30:40,814 INFO L175 Difference]: Start difference. First operand has 364 places, 366 transitions, 861 flow. Second operand 3 states and 1182 transitions. [2025-01-09 21:30:40,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 364 transitions, 877 flow [2025-01-09 21:30:40,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 364 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:40,818 INFO L231 Difference]: Finished difference. Result has 363 places, 0 transitions, 0 flow [2025-01-09 21:30:40,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=363, PETRI_TRANSITIONS=0} [2025-01-09 21:30:40,819 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -17 predicate places. [2025-01-09 21:30:40,819 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 0 transitions, 0 flow [2025-01-09 21:30:40,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:40,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-01-09 21:30:40,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-01-09 21:30:40,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-01-09 21:30:40,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-01-09 21:30:40,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-01-09 21:30:40,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-01-09 21:30:40,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-01-09 21:30:40,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-01-09 21:30:40,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-01-09 21:30:40,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-01-09 21:30:40,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-01-09 21:30:40,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-01-09 21:30:40,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-01-09 21:30:40,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-01-09 21:30:40,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-01-09 21:30:40,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-01-09 21:30:40,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-01-09 21:30:40,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-01-09 21:30:40,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-01-09 21:30:40,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-01-09 21:30:40,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:30:40,827 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:40,832 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:40,832 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:40,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:40 BasicIcfg [2025-01-09 21:30:40,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:40,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:40,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:40,839 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:40,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:32" (3/4) ... [2025-01-09 21:30:40,840 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:40,842 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:40,843 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:40,843 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:30:40,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 21:30:40,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:40,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:40,848 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:40,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:40,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:40,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:40,916 INFO L158 Benchmark]: Toolchain (without parser) took 9254.88ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 105.7MB in the beginning and 268.8MB in the end (delta: -163.1MB). Peak memory consumption was 444.7MB. Max. memory is 16.1GB. [2025-01-09 21:30:40,916 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:40,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.27ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.5MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:40,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.95ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 90.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:40,918 INFO L158 Benchmark]: Boogie Preprocessor took 25.79ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:40,918 INFO L158 Benchmark]: RCFGBuilder took 468.20ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 62.5MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:30:40,919 INFO L158 Benchmark]: TraceAbstraction took 8380.12ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 61.6MB in the beginning and 273.0MB in the end (delta: -211.4MB). Peak memory consumption was 402.7MB. Max. memory is 16.1GB. [2025-01-09 21:30:40,919 INFO L158 Benchmark]: Witness Printer took 76.29ms. Allocated memory is still 755.0MB. Free memory was 273.0MB in the beginning and 268.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:40,920 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.23ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.27ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.5MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.95ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 90.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.79ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 468.20ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 62.5MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8380.12ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 61.6MB in the beginning and 273.0MB in the end (delta: -211.4MB). Peak memory consumption was 402.7MB. Max. memory is 16.1GB. * Witness Printer took 76.29ms. Allocated memory is still 755.0MB. Free memory was 273.0MB in the beginning and 268.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 620 locations, 71 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: 8.2s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 512 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 660 IncrementalHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 104 mSDtfsCounter, 660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=864occurred in iteration=21, InterpolantAutomatonStates: 72, 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.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2446 NumberOfCodeBlocks, 2446 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2422 ConstructedInterpolants, 0 QuantifiedInterpolants, 2470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:40,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE