./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-5.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/unroll-5.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 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:34:19,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:34:19,441 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:34:19,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:34:19,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:34:19,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:34:19,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:34:19,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:34:19,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:34:19,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:34:19,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:34:19,477 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:34:19,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:19,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:19,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:34:19,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:34:19,485 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 -> 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 [2025-01-09 21:34:19,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:34:19,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:34:19,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:34:19,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:34:19,702 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:34:19,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-5.wvr.c [2025-01-09 21:34:20,801 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9797b41af/fb26aae9ef4048deadf4d3df2f16d348/FLAG98a6350b2 [2025-01-09 21:34:21,096 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:34:21,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-5.wvr.c [2025-01-09 21:34:21,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9797b41af/fb26aae9ef4048deadf4d3df2f16d348/FLAG98a6350b2 [2025-01-09 21:34:21,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9797b41af/fb26aae9ef4048deadf4d3df2f16d348 [2025-01-09 21:34:21,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:34:21,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:34:21,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:21,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:34:21,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:34:21,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274c4299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21, skipping insertion in model container [2025-01-09 21:34:21,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:34:21,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:21,542 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:34:21,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:21,570 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:34:21,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21 WrapperNode [2025-01-09 21:34:21,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:21,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:21,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:34:21,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:34:21,575 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:34:21" (1/1) ... [2025-01-09 21:34:21,581 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:34:21" (1/1) ... [2025-01-09 21:34:21,599 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 325 [2025-01-09 21:34:21,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:21,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:34:21,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:34:21,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:34:21,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:34:21,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:34:21,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:34:21,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:34:21,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (1/1) ... [2025-01-09 21:34:21,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:21,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:34:21,649 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:34:21,654 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:34:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:34:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:34:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:34:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:34:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:34:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:34:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:34:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:34:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:34:21,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:34:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:34:21,668 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:34:21,732 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:34:21,733 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:34:22,117 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:34:22,117 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:34:22,138 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:34:22,140 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:34:22,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:22 BoogieIcfgContainer [2025-01-09 21:34:22,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:34:22,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:34:22,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:34:22,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:34:22,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:34:21" (1/3) ... [2025-01-09 21:34:22,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4393a84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:22, skipping insertion in model container [2025-01-09 21:34:22,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:21" (2/3) ... [2025-01-09 21:34:22,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4393a84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:22, skipping insertion in model container [2025-01-09 21:34:22,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:22" (3/3) ... [2025-01-09 21:34:22,149 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2025-01-09 21:34:22,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:34:22,162 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-5.wvr.c that has 3 procedures, 417 locations, 1 initial locations, 3 loop locations, and 53 error locations. [2025-01-09 21:34:22,163 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:34:22,244 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:34:22,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 423 places, 438 transitions, 890 flow [2025-01-09 21:34:22,386 INFO L124 PetriNetUnfolderBase]: 22/436 cut-off events. [2025-01-09 21:34:22,388 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:34:22,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 436 events. 22/436 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 520 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 300. Up to 2 conditions per place. [2025-01-09 21:34:22,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 423 places, 438 transitions, 890 flow [2025-01-09 21:34:22,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 405 places, 419 transitions, 850 flow [2025-01-09 21:34:22,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:34:22,417 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;@47596a51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:34:22,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 99 error locations. [2025-01-09 21:34:22,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:34:22,421 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 21:34:22,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:34:22,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:22,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:22,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:22,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1850964267, now seen corresponding path program 1 times [2025-01-09 21:34:22,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:22,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014143532] [2025-01-09 21:34:22,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:22,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:34:22,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:34:22,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:22,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:22,530 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:34:22,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:22,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014143532] [2025-01-09 21:34:22,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014143532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:22,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:22,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:22,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087570446] [2025-01-09 21:34:22,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:22,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:22,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:22,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:22,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 438 [2025-01-09 21:34:22,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 419 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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:34:22,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:22,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 438 [2025-01-09 21:34:22,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:22,659 INFO L124 PetriNetUnfolderBase]: 16/514 cut-off events. [2025-01-09 21:34:22,660 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:34:22,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 514 events. 16/514 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1078 event pairs, 3 based on Foata normal form. 12/433 useless extension candidates. Maximal degree in co-relation 409. Up to 19 conditions per place. [2025-01-09 21:34:22,665 INFO L140 encePairwiseOnDemand]: 423/438 looper letters, 10 selfloop transitions, 2 changer transitions 4/406 dead transitions. [2025-01-09 21:34:22,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 848 flow [2025-01-09 21:34:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1255 transitions. [2025-01-09 21:34:22,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550989345509894 [2025-01-09 21:34:22,677 INFO L175 Difference]: Start difference. First operand has 405 places, 419 transitions, 850 flow. Second operand 3 states and 1255 transitions. [2025-01-09 21:34:22,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 848 flow [2025-01-09 21:34:22,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 406 transitions, 840 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:34:22,687 INFO L231 Difference]: Finished difference. Result has 402 places, 402 transitions, 812 flow [2025-01-09 21:34:22,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=402, PETRI_TRANSITIONS=402} [2025-01-09 21:34:22,691 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -3 predicate places. [2025-01-09 21:34:22,691 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 402 transitions, 812 flow [2025-01-09 21:34:22,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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:34:22,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:22,692 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] [2025-01-09 21:34:22,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:34:22,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1051774669, now seen corresponding path program 1 times [2025-01-09 21:34:22,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:22,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241721763] [2025-01-09 21:34:22,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:22,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:34:22,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:34:22,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:22,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:22,721 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:34:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241721763] [2025-01-09 21:34:22,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241721763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:22,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:22,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:22,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063202694] [2025-01-09 21:34:22,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:22,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:22,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:22,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:22,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:22,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 438 [2025-01-09 21:34:22,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 402 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 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:34:22,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:22,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 438 [2025-01-09 21:34:22,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:22,844 INFO L124 PetriNetUnfolderBase]: 26/649 cut-off events. [2025-01-09 21:34:22,845 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:34:22,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 649 events. 26/649 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1652 event pairs, 11 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 668. Up to 38 conditions per place. [2025-01-09 21:34:22,848 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 15 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-01-09 21:34:22,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 844 flow [2025-01-09 21:34:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2025-01-09 21:34:22,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9383561643835616 [2025-01-09 21:34:22,851 INFO L175 Difference]: Start difference. First operand has 402 places, 402 transitions, 812 flow. Second operand 3 states and 1233 transitions. [2025-01-09 21:34:22,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 844 flow [2025-01-09 21:34:22,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 401 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:22,856 INFO L231 Difference]: Finished difference. Result has 397 places, 401 transitions, 810 flow [2025-01-09 21:34:22,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=397, PETRI_TRANSITIONS=401} [2025-01-09 21:34:22,857 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -8 predicate places. [2025-01-09 21:34:22,857 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 401 transitions, 810 flow [2025-01-09 21:34:22,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 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:34:22,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:22,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:22,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:34:22,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:22,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:22,859 INFO L85 PathProgramCache]: Analyzing trace with hash 949127179, now seen corresponding path program 1 times [2025-01-09 21:34:22,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:22,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070120254] [2025-01-09 21:34:22,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:22,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:34:22,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:34:22,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:22,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:22,883 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:34:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:22,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070120254] [2025-01-09 21:34:22,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070120254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:22,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:22,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:22,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822981644] [2025-01-09 21:34:22,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:22,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:22,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:22,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:22,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:22,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-01-09 21:34:22,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 401 transitions, 810 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:34:22,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:22,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-01-09 21:34:22,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:23,109 INFO L124 PetriNetUnfolderBase]: 96/1418 cut-off events. [2025-01-09 21:34:23,110 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:34:23,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1418 events. 96/1418 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 6388 event pairs, 32 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 1509. Up to 117 conditions per place. [2025-01-09 21:34:23,121 INFO L140 encePairwiseOnDemand]: 429/438 looper letters, 20 selfloop transitions, 1 changer transitions 0/393 dead transitions. [2025-01-09 21:34:23,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 393 transitions, 836 flow [2025-01-09 21:34:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2025-01-09 21:34:23,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.923896499238965 [2025-01-09 21:34:23,127 INFO L175 Difference]: Start difference. First operand has 397 places, 401 transitions, 810 flow. Second operand 3 states and 1214 transitions. [2025-01-09 21:34:23,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 393 transitions, 836 flow [2025-01-09 21:34:23,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 393 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:23,132 INFO L231 Difference]: Finished difference. Result has 389 places, 393 transitions, 792 flow [2025-01-09 21:34:23,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=389, PETRI_TRANSITIONS=393} [2025-01-09 21:34:23,133 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -16 predicate places. [2025-01-09 21:34:23,134 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 393 transitions, 792 flow [2025-01-09 21:34:23,135 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:34:23,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:23,135 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] [2025-01-09 21:34:23,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:34:23,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:23,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash -841416700, now seen corresponding path program 1 times [2025-01-09 21:34:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:23,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881605883] [2025-01-09 21:34:23,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:23,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:23,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:34:23,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:34:23,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:23,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:23,677 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:34:23,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:23,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881605883] [2025-01-09 21:34:23,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881605883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:23,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:23,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:23,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570729056] [2025-01-09 21:34:23,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:23,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:23,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:23,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:23,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:23,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 438 [2025-01-09 21:34:23,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 393 transitions, 792 flow. Second operand has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 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:34:23,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:23,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 438 [2025-01-09 21:34:23,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:24,064 INFO L124 PetriNetUnfolderBase]: 188/1753 cut-off events. [2025-01-09 21:34:24,065 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-01-09 21:34:24,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 1753 events. 188/1753 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8979 event pairs, 104 based on Foata normal form. 0/1456 useless extension candidates. Maximal degree in co-relation 2024. Up to 292 conditions per place. [2025-01-09 21:34:24,076 INFO L140 encePairwiseOnDemand]: 432/438 looper letters, 36 selfloop transitions, 5 changer transitions 0/392 dead transitions. [2025-01-09 21:34:24,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 392 transitions, 872 flow [2025-01-09 21:34:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2334 transitions. [2025-01-09 21:34:24,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8881278538812786 [2025-01-09 21:34:24,080 INFO L175 Difference]: Start difference. First operand has 389 places, 393 transitions, 792 flow. Second operand 6 states and 2334 transitions. [2025-01-09 21:34:24,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 392 transitions, 872 flow [2025-01-09 21:34:24,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 392 transitions, 871 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:24,085 INFO L231 Difference]: Finished difference. Result has 392 places, 392 transitions, 799 flow [2025-01-09 21:34:24,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=799, PETRI_PLACES=392, PETRI_TRANSITIONS=392} [2025-01-09 21:34:24,087 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -13 predicate places. [2025-01-09 21:34:24,087 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 392 transitions, 799 flow [2025-01-09 21:34:24,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 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:34:24,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:24,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] [2025-01-09 21:34:24,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:34:24,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:24,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1462091118, now seen corresponding path program 1 times [2025-01-09 21:34:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:24,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020786925] [2025-01-09 21:34:24,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:24,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:24,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:34:24,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:34:24,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:24,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:24,131 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:34:24,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020786925] [2025-01-09 21:34:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020786925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:24,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:24,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896453225] [2025-01-09 21:34:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:24,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:24,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:24,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:24,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 438 [2025-01-09 21:34:24,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 392 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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:34:24,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:24,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 438 [2025-01-09 21:34:24,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:24,229 INFO L124 PetriNetUnfolderBase]: 26/634 cut-off events. [2025-01-09 21:34:24,229 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:34:24,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 634 events. 26/634 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1611 event pairs, 11 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 665. Up to 36 conditions per place. [2025-01-09 21:34:24,245 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 13 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2025-01-09 21:34:24,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 391 transitions, 827 flow [2025-01-09 21:34:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2025-01-09 21:34:24,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.941400304414003 [2025-01-09 21:34:24,251 INFO L175 Difference]: Start difference. First operand has 392 places, 392 transitions, 799 flow. Second operand 3 states and 1237 transitions. [2025-01-09 21:34:24,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 391 transitions, 827 flow [2025-01-09 21:34:24,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 391 transitions, 817 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:24,256 INFO L231 Difference]: Finished difference. Result has 388 places, 391 transitions, 791 flow [2025-01-09 21:34:24,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=388, PETRI_TRANSITIONS=391} [2025-01-09 21:34:24,258 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -17 predicate places. [2025-01-09 21:34:24,259 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 391 transitions, 791 flow [2025-01-09 21:34:24,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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:34:24,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:24,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:24,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:34:24,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1470919491, now seen corresponding path program 1 times [2025-01-09 21:34:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:24,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424769083] [2025-01-09 21:34:24,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:24,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:24,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:34:24,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:34:24,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:24,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:24,300 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:34:24,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:24,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424769083] [2025-01-09 21:34:24,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424769083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:24,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:24,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:24,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268836768] [2025-01-09 21:34:24,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:24,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:24,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:24,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:24,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:24,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 438 [2025-01-09 21:34:24,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 391 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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:34:24,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:24,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 438 [2025-01-09 21:34:24,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:24,424 INFO L124 PetriNetUnfolderBase]: 40/1161 cut-off events. [2025-01-09 21:34:24,425 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:34:24,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 1161 events. 40/1161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4678 event pairs, 8 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1168. Up to 32 conditions per place. [2025-01-09 21:34:24,429 INFO L140 encePairwiseOnDemand]: 434/438 looper letters, 10 selfloop transitions, 1 changer transitions 0/388 dead transitions. [2025-01-09 21:34:24,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 388 transitions, 807 flow [2025-01-09 21:34:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1244 transitions. [2025-01-09 21:34:24,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467275494672754 [2025-01-09 21:34:24,431 INFO L175 Difference]: Start difference. First operand has 388 places, 391 transitions, 791 flow. Second operand 3 states and 1244 transitions. [2025-01-09 21:34:24,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 388 transitions, 807 flow [2025-01-09 21:34:24,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 388 transitions, 803 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:24,435 INFO L231 Difference]: Finished difference. Result has 385 places, 388 transitions, 783 flow [2025-01-09 21:34:24,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=385, PETRI_TRANSITIONS=388} [2025-01-09 21:34:24,436 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -20 predicate places. [2025-01-09 21:34:24,436 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 388 transitions, 783 flow [2025-01-09 21:34:24,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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:34:24,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:24,437 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] [2025-01-09 21:34:24,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:34:24,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:24,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:24,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1921820715, now seen corresponding path program 1 times [2025-01-09 21:34:24,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:24,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909106340] [2025-01-09 21:34:24,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:24,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:24,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 21:34:24,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 21:34:24,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:24,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:24,469 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:34:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:24,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909106340] [2025-01-09 21:34:24,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909106340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:24,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:24,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301436914] [2025-01-09 21:34:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:24,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:24,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:24,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:24,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 438 [2025-01-09 21:34:24,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 388 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 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:34:24,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:24,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 438 [2025-01-09 21:34:24,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:24,519 INFO L124 PetriNetUnfolderBase]: 19/439 cut-off events. [2025-01-09 21:34:24,519 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:34:24,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 439 events. 19/439 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 705 event pairs, 1 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 447. Up to 21 conditions per place. [2025-01-09 21:34:24,521 INFO L140 encePairwiseOnDemand]: 431/438 looper letters, 11 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2025-01-09 21:34:24,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 385 transitions, 806 flow [2025-01-09 21:34:24,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2025-01-09 21:34:24,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9429223744292238 [2025-01-09 21:34:24,523 INFO L175 Difference]: Start difference. First operand has 385 places, 388 transitions, 783 flow. Second operand 3 states and 1239 transitions. [2025-01-09 21:34:24,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 385 transitions, 806 flow [2025-01-09 21:34:24,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 385 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:24,527 INFO L231 Difference]: Finished difference. Result has 382 places, 384 transitions, 780 flow [2025-01-09 21:34:24,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=382, PETRI_TRANSITIONS=384} [2025-01-09 21:34:24,528 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -23 predicate places. [2025-01-09 21:34:24,528 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 384 transitions, 780 flow [2025-01-09 21:34:24,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 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:34:24,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:24,529 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] [2025-01-09 21:34:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:34:24,529 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:24,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1573708939, now seen corresponding path program 1 times [2025-01-09 21:34:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645688108] [2025-01-09 21:34:24,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:24,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 21:34:24,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 21:34:24,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:24,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:24,572 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:34:24,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:24,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645688108] [2025-01-09 21:34:24,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645688108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:24,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:24,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491942243] [2025-01-09 21:34:24,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:24,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:24,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:24,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:24,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:24,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 438 [2025-01-09 21:34:24,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 384 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 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:34:24,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:24,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 438 [2025-01-09 21:34:24,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:24,696 INFO L124 PetriNetUnfolderBase]: 49/568 cut-off events. [2025-01-09 21:34:24,697 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-09 21:34:24,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 568 events. 49/568 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1663 event pairs, 5 based on Foata normal form. 1/516 useless extension candidates. Maximal degree in co-relation 653. Up to 91 conditions per place. [2025-01-09 21:34:24,700 INFO L140 encePairwiseOnDemand]: 411/438 looper letters, 29 selfloop transitions, 10 changer transitions 4/369 dead transitions. [2025-01-09 21:34:24,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 369 transitions, 833 flow [2025-01-09 21:34:24,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1158 transitions. [2025-01-09 21:34:24,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8812785388127854 [2025-01-09 21:34:24,702 INFO L175 Difference]: Start difference. First operand has 382 places, 384 transitions, 780 flow. Second operand 3 states and 1158 transitions. [2025-01-09 21:34:24,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 369 transitions, 833 flow [2025-01-09 21:34:24,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 369 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:24,707 INFO L231 Difference]: Finished difference. Result has 366 places, 364 transitions, 753 flow [2025-01-09 21:34:24,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=366, PETRI_TRANSITIONS=364} [2025-01-09 21:34:24,708 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -39 predicate places. [2025-01-09 21:34:24,709 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 364 transitions, 753 flow [2025-01-09 21:34:24,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 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:34:24,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:24,710 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:34:24,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:34:24,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:24,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1828506032, now seen corresponding path program 1 times [2025-01-09 21:34:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:24,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909125228] [2025-01-09 21:34:24,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:24,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:24,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:34:24,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:34:24,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:24,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:24,749 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:34:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:24,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909125228] [2025-01-09 21:34:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909125228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:24,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:24,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91308463] [2025-01-09 21:34:24,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:24,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:24,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:24,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:24,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:24,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 438 [2025-01-09 21:34:24,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 364 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 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:34:24,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:24,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 438 [2025-01-09 21:34:24,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:24,868 INFO L124 PetriNetUnfolderBase]: 85/1157 cut-off events. [2025-01-09 21:34:24,868 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:34:24,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1157 events. 85/1157 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4637 event pairs, 10 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 1280. Up to 104 conditions per place. [2025-01-09 21:34:24,873 INFO L140 encePairwiseOnDemand]: 430/438 looper letters, 18 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-01-09 21:34:24,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 791 flow [2025-01-09 21:34:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1229 transitions. [2025-01-09 21:34:24,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9353120243531202 [2025-01-09 21:34:24,875 INFO L175 Difference]: Start difference. First operand has 366 places, 364 transitions, 753 flow. Second operand 3 states and 1229 transitions. [2025-01-09 21:34:24,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 791 flow [2025-01-09 21:34:24,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 771 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:24,881 INFO L231 Difference]: Finished difference. Result has 357 places, 360 transitions, 735 flow [2025-01-09 21:34:24,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=357, PETRI_TRANSITIONS=360} [2025-01-09 21:34:24,882 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -48 predicate places. [2025-01-09 21:34:24,882 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 360 transitions, 735 flow [2025-01-09 21:34:24,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 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:34:24,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:24,883 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:34:24,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:34:24,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:24,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1794943626, now seen corresponding path program 1 times [2025-01-09 21:34:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:24,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151460656] [2025-01-09 21:34:24,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:24,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:34:24,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:34:24,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:24,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:24,963 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:34:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:24,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151460656] [2025-01-09 21:34:24,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151460656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:24,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:24,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:34:24,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727269785] [2025-01-09 21:34:24,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:24,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:34:24,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:24,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:34:24,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:34:24,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 438 [2025-01-09 21:34:24,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 360 transitions, 735 flow. Second operand has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 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:34:24,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:24,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 438 [2025-01-09 21:34:24,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:25,093 INFO L124 PetriNetUnfolderBase]: 49/1348 cut-off events. [2025-01-09 21:34:25,093 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:34:25,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1348 events. 49/1348 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5252 event pairs, 3 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 1383. Up to 18 conditions per place. [2025-01-09 21:34:25,099 INFO L140 encePairwiseOnDemand]: 432/438 looper letters, 13 selfloop transitions, 6 changer transitions 0/369 dead transitions. [2025-01-09 21:34:25,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 369 transitions, 795 flow [2025-01-09 21:34:25,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:34:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:34:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2085 transitions. [2025-01-09 21:34:25,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952054794520548 [2025-01-09 21:34:25,102 INFO L175 Difference]: Start difference. First operand has 357 places, 360 transitions, 735 flow. Second operand 5 states and 2085 transitions. [2025-01-09 21:34:25,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 369 transitions, 795 flow [2025-01-09 21:34:25,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 369 transitions, 795 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:25,106 INFO L231 Difference]: Finished difference. Result has 364 places, 364 transitions, 773 flow [2025-01-09 21:34:25,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=773, PETRI_PLACES=364, PETRI_TRANSITIONS=364} [2025-01-09 21:34:25,107 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -41 predicate places. [2025-01-09 21:34:25,107 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 364 transitions, 773 flow [2025-01-09 21:34:25,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 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:34:25,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:25,108 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] [2025-01-09 21:34:25,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:34:25,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:25,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1466359094, now seen corresponding path program 1 times [2025-01-09 21:34:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:25,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373345292] [2025-01-09 21:34:25,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:25,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:25,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:34:25,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:34:25,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:25,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:25,402 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:34:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373345292] [2025-01-09 21:34:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373345292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:25,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885978179] [2025-01-09 21:34:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:25,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:25,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:25,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:25,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:25,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 438 [2025-01-09 21:34:25,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 364 transitions, 773 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 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:34:25,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:25,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 438 [2025-01-09 21:34:25,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:25,787 INFO L124 PetriNetUnfolderBase]: 42/1051 cut-off events. [2025-01-09 21:34:25,787 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:34:25,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 1051 events. 42/1051 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3364 event pairs, 2 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1107. Up to 17 conditions per place. [2025-01-09 21:34:25,792 INFO L140 encePairwiseOnDemand]: 432/438 looper letters, 15 selfloop transitions, 6 changer transitions 0/367 dead transitions. [2025-01-09 21:34:25,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 367 transitions, 825 flow [2025-01-09 21:34:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2457 transitions. [2025-01-09 21:34:25,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934931506849315 [2025-01-09 21:34:25,796 INFO L175 Difference]: Start difference. First operand has 364 places, 364 transitions, 773 flow. Second operand 6 states and 2457 transitions. [2025-01-09 21:34:25,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 367 transitions, 825 flow [2025-01-09 21:34:25,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 367 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:25,800 INFO L231 Difference]: Finished difference. Result has 368 places, 363 transitions, 783 flow [2025-01-09 21:34:25,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=368, PETRI_TRANSITIONS=363} [2025-01-09 21:34:25,801 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -37 predicate places. [2025-01-09 21:34:25,801 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 363 transitions, 783 flow [2025-01-09 21:34:25,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 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:34:25,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:25,802 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:34:25,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:34:25,802 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:25,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2147132563, now seen corresponding path program 1 times [2025-01-09 21:34:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:25,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729456020] [2025-01-09 21:34:25,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:25,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:25,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:34:25,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:34:25,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:25,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:25,865 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:34:25,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:25,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729456020] [2025-01-09 21:34:25,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729456020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:25,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:25,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:34:25,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566727613] [2025-01-09 21:34:25,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:25,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:34:25,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:25,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:34:25,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:34:25,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 438 [2025-01-09 21:34:25,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 363 transitions, 783 flow. Second operand has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 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:34:25,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:25,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 438 [2025-01-09 21:34:25,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:26,148 INFO L124 PetriNetUnfolderBase]: 63/1321 cut-off events. [2025-01-09 21:34:26,151 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2025-01-09 21:34:26,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1321 events. 63/1321 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5842 event pairs, 6 based on Foata normal form. 0/1198 useless extension candidates. Maximal degree in co-relation 1430. Up to 67 conditions per place. [2025-01-09 21:34:26,161 INFO L140 encePairwiseOnDemand]: 432/438 looper letters, 16 selfloop transitions, 6 changer transitions 0/371 dead transitions. [2025-01-09 21:34:26,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 371 transitions, 846 flow [2025-01-09 21:34:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:34:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:34:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2068 transitions. [2025-01-09 21:34:26,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9442922374429223 [2025-01-09 21:34:26,168 INFO L175 Difference]: Start difference. First operand has 368 places, 363 transitions, 783 flow. Second operand 5 states and 2068 transitions. [2025-01-09 21:34:26,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 371 transitions, 846 flow [2025-01-09 21:34:26,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 371 transitions, 834 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:26,172 INFO L231 Difference]: Finished difference. Result has 370 places, 367 transitions, 809 flow [2025-01-09 21:34:26,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=809, PETRI_PLACES=370, PETRI_TRANSITIONS=367} [2025-01-09 21:34:26,173 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -35 predicate places. [2025-01-09 21:34:26,173 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 367 transitions, 809 flow [2025-01-09 21:34:26,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 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:34:26,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:26,174 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] [2025-01-09 21:34:26,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:34:26,174 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:26,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:26,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1670533753, now seen corresponding path program 1 times [2025-01-09 21:34:26,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:26,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917842871] [2025-01-09 21:34:26,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:26,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:26,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 21:34:26,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 21:34:26,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:26,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:26,202 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:34:26,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917842871] [2025-01-09 21:34:26,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917842871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:26,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:26,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:26,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694728640] [2025-01-09 21:34:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:26,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:26,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:26,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:26,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:26,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 438 [2025-01-09 21:34:26,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 367 transitions, 809 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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:34:26,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:26,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 438 [2025-01-09 21:34:26,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:26,292 INFO L124 PetriNetUnfolderBase]: 37/937 cut-off events. [2025-01-09 21:34:26,293 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:34:26,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 937 events. 37/937 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2524 event pairs, 10 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1025. Up to 29 conditions per place. [2025-01-09 21:34:26,297 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 9 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-01-09 21:34:26,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 367 transitions, 832 flow [2025-01-09 21:34:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-01-09 21:34:26,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9474885844748858 [2025-01-09 21:34:26,299 INFO L175 Difference]: Start difference. First operand has 370 places, 367 transitions, 809 flow. Second operand 3 states and 1245 transitions. [2025-01-09 21:34:26,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 367 transitions, 832 flow [2025-01-09 21:34:26,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 367 transitions, 832 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:26,303 INFO L231 Difference]: Finished difference. Result has 371 places, 366 transitions, 811 flow [2025-01-09 21:34:26,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=371, PETRI_TRANSITIONS=366} [2025-01-09 21:34:26,304 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -34 predicate places. [2025-01-09 21:34:26,304 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 366 transitions, 811 flow [2025-01-09 21:34:26,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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:34:26,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:26,305 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] [2025-01-09 21:34:26,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:34:26,305 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:26,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:26,305 INFO L85 PathProgramCache]: Analyzing trace with hash 780000278, now seen corresponding path program 1 times [2025-01-09 21:34:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:26,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254303887] [2025-01-09 21:34:26,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:26,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:26,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:34:26,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:34:26,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:26,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:26,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:26,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254303887] [2025-01-09 21:34:26,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254303887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:26,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:26,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:26,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890136917] [2025-01-09 21:34:26,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:26,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:26,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:26,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:26,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 438 [2025-01-09 21:34:26,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 366 transitions, 811 flow. Second operand has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 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:34:26,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:26,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 438 [2025-01-09 21:34:26,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:26,962 INFO L124 PetriNetUnfolderBase]: 102/1146 cut-off events. [2025-01-09 21:34:26,962 INFO L125 PetriNetUnfolderBase]: For 91/92 co-relation queries the response was YES. [2025-01-09 21:34:26,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1146 events. 102/1146 cut-off events. For 91/92 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5675 event pairs, 12 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1447. Up to 84 conditions per place. [2025-01-09 21:34:26,967 INFO L140 encePairwiseOnDemand]: 408/438 looper letters, 19 selfloop transitions, 26 changer transitions 0/365 dead transitions. [2025-01-09 21:34:26,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 365 transitions, 903 flow [2025-01-09 21:34:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2317 transitions. [2025-01-09 21:34:26,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8816590563165906 [2025-01-09 21:34:26,971 INFO L175 Difference]: Start difference. First operand has 371 places, 366 transitions, 811 flow. Second operand 6 states and 2317 transitions. [2025-01-09 21:34:26,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 365 transitions, 903 flow [2025-01-09 21:34:26,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 365 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:26,975 INFO L231 Difference]: Finished difference. Result has 369 places, 361 transitions, 849 flow [2025-01-09 21:34:26,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=849, PETRI_PLACES=369, PETRI_TRANSITIONS=361} [2025-01-09 21:34:26,976 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -36 predicate places. [2025-01-09 21:34:26,976 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 361 transitions, 849 flow [2025-01-09 21:34:26,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 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:34:26,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:26,977 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] [2025-01-09 21:34:26,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:34:26,977 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:26,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:26,978 INFO L85 PathProgramCache]: Analyzing trace with hash -949438695, now seen corresponding path program 1 times [2025-01-09 21:34:26,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:26,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612496194] [2025-01-09 21:34:26,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:26,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:26,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:34:26,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:34:26,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:26,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:27,011 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:34:27,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612496194] [2025-01-09 21:34:27,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612496194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:27,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890804109] [2025-01-09 21:34:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:27,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:27,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:27,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:27,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:27,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-01-09 21:34:27,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 361 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 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:34:27,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:27,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-01-09 21:34:27,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:27,219 INFO L124 PetriNetUnfolderBase]: 89/1309 cut-off events. [2025-01-09 21:34:27,220 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2025-01-09 21:34:27,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 1309 events. 89/1309 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6377 event pairs, 50 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 1687. Up to 170 conditions per place. [2025-01-09 21:34:27,224 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 25 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-01-09 21:34:27,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 361 transitions, 904 flow [2025-01-09 21:34:27,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-01-09 21:34:27,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231354642313546 [2025-01-09 21:34:27,230 INFO L175 Difference]: Start difference. First operand has 369 places, 361 transitions, 849 flow. Second operand 3 states and 1213 transitions. [2025-01-09 21:34:27,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 361 transitions, 904 flow [2025-01-09 21:34:27,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 361 transitions, 852 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:27,234 INFO L231 Difference]: Finished difference. Result has 365 places, 360 transitions, 799 flow [2025-01-09 21:34:27,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=365, PETRI_TRANSITIONS=360} [2025-01-09 21:34:27,234 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -40 predicate places. [2025-01-09 21:34:27,234 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 360 transitions, 799 flow [2025-01-09 21:34:27,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 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:34:27,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:27,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:27,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:34:27,235 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:27,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2120387440, now seen corresponding path program 1 times [2025-01-09 21:34:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989185020] [2025-01-09 21:34:27,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:27,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 21:34:27,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 21:34:27,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:27,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:27,267 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:34:27,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989185020] [2025-01-09 21:34:27,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989185020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:27,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:27,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:27,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434025341] [2025-01-09 21:34:27,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:27,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:27,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:27,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:27,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-01-09 21:34:27,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 360 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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:34:27,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:27,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-01-09 21:34:27,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:27,487 INFO L124 PetriNetUnfolderBase]: 88/1272 cut-off events. [2025-01-09 21:34:27,487 INFO L125 PetriNetUnfolderBase]: For 79/80 co-relation queries the response was YES. [2025-01-09 21:34:27,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 1272 events. 88/1272 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6135 event pairs, 50 based on Foata normal form. 0/1196 useless extension candidates. Maximal degree in co-relation 1515. Up to 170 conditions per place. [2025-01-09 21:34:27,494 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 25 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-01-09 21:34:27,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 360 transitions, 854 flow [2025-01-09 21:34:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-01-09 21:34:27,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231354642313546 [2025-01-09 21:34:27,497 INFO L175 Difference]: Start difference. First operand has 365 places, 360 transitions, 799 flow. Second operand 3 states and 1213 transitions. [2025-01-09 21:34:27,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 360 transitions, 854 flow [2025-01-09 21:34:27,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 360 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:27,501 INFO L231 Difference]: Finished difference. Result has 364 places, 359 transitions, 797 flow [2025-01-09 21:34:27,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=364, PETRI_TRANSITIONS=359} [2025-01-09 21:34:27,502 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -41 predicate places. [2025-01-09 21:34:27,502 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 359 transitions, 797 flow [2025-01-09 21:34:27,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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:34:27,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:27,503 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:34:27,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:34:27,503 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:27,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1673808857, now seen corresponding path program 1 times [2025-01-09 21:34:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:27,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571985420] [2025-01-09 21:34:27,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:27,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 21:34:27,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 21:34:27,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:27,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:27,550 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:34:27,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571985420] [2025-01-09 21:34:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571985420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:27,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:27,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:27,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281708395] [2025-01-09 21:34:27,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:27,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:27,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:27,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:27,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:27,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-01-09 21:34:27,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 359 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 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:34:27,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:27,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-01-09 21:34:27,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:27,865 INFO L124 PetriNetUnfolderBase]: 87/1234 cut-off events. [2025-01-09 21:34:27,865 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2025-01-09 21:34:27,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 1234 events. 87/1234 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5885 event pairs, 50 based on Foata normal form. 0/1164 useless extension candidates. Maximal degree in co-relation 1476. Up to 170 conditions per place. [2025-01-09 21:34:27,881 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 25 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-01-09 21:34:27,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 359 transitions, 852 flow [2025-01-09 21:34:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-01-09 21:34:27,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231354642313546 [2025-01-09 21:34:27,887 INFO L175 Difference]: Start difference. First operand has 364 places, 359 transitions, 797 flow. Second operand 3 states and 1213 transitions. [2025-01-09 21:34:27,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 359 transitions, 852 flow [2025-01-09 21:34:27,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 359 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:27,895 INFO L231 Difference]: Finished difference. Result has 363 places, 358 transitions, 795 flow [2025-01-09 21:34:27,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=363, PETRI_TRANSITIONS=358} [2025-01-09 21:34:27,900 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -42 predicate places. [2025-01-09 21:34:27,900 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 358 transitions, 795 flow [2025-01-09 21:34:27,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 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:34:27,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:27,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:27,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:34:27,902 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:27,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:27,902 INFO L85 PathProgramCache]: Analyzing trace with hash 206372318, now seen corresponding path program 1 times [2025-01-09 21:34:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:27,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380617926] [2025-01-09 21:34:27,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:27,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 21:34:27,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 21:34:27,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:27,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:27,967 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:34:27,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:27,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380617926] [2025-01-09 21:34:27,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380617926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:27,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:27,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33514949] [2025-01-09 21:34:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:27,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:27,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:27,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:27,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:28,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-01-09 21:34:28,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 358 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 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:34:28,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:28,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-01-09 21:34:28,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:28,181 INFO L124 PetriNetUnfolderBase]: 86/1196 cut-off events. [2025-01-09 21:34:28,181 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2025-01-09 21:34:28,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1196 events. 86/1196 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5638 event pairs, 50 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 1438. Up to 170 conditions per place. [2025-01-09 21:34:28,185 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 25 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-01-09 21:34:28,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 358 transitions, 850 flow [2025-01-09 21:34:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-01-09 21:34:28,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231354642313546 [2025-01-09 21:34:28,188 INFO L175 Difference]: Start difference. First operand has 363 places, 358 transitions, 795 flow. Second operand 3 states and 1213 transitions. [2025-01-09 21:34:28,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 358 transitions, 850 flow [2025-01-09 21:34:28,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 358 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:28,191 INFO L231 Difference]: Finished difference. Result has 362 places, 357 transitions, 793 flow [2025-01-09 21:34:28,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=362, PETRI_TRANSITIONS=357} [2025-01-09 21:34:28,192 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -43 predicate places. [2025-01-09 21:34:28,192 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 357 transitions, 793 flow [2025-01-09 21:34:28,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 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:34:28,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:28,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:28,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:34:28,193 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2025-01-09 21:34:28,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1149445707, now seen corresponding path program 1 times [2025-01-09 21:34:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:28,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281639472] [2025-01-09 21:34:28,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:28,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-01-09 21:34:28,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-01-09 21:34:28,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:28,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:28,278 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:34:28,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:28,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281639472] [2025-01-09 21:34:28,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281639472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:28,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264019803] [2025-01-09 21:34:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:28,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:28,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:28,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:28,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:28,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 438 [2025-01-09 21:34:28,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 357 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 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:34:28,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:28,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 438 [2025-01-09 21:34:28,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:28,445 INFO L124 PetriNetUnfolderBase]: 85/1158 cut-off events. [2025-01-09 21:34:28,445 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2025-01-09 21:34:28,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 1158 events. 85/1158 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5409 event pairs, 50 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1400. Up to 170 conditions per place. [2025-01-09 21:34:28,450 INFO L140 encePairwiseOnDemand]: 435/438 looper letters, 0 selfloop transitions, 0 changer transitions 357/357 dead transitions. [2025-01-09 21:34:28,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 848 flow [2025-01-09 21:34:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2025-01-09 21:34:28,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231354642313546 [2025-01-09 21:34:28,452 INFO L175 Difference]: Start difference. First operand has 362 places, 357 transitions, 793 flow. Second operand 3 states and 1213 transitions. [2025-01-09 21:34:28,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 848 flow [2025-01-09 21:34:28,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 357 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:28,455 INFO L231 Difference]: Finished difference. Result has 361 places, 0 transitions, 0 flow [2025-01-09 21:34:28,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=361, PETRI_TRANSITIONS=0} [2025-01-09 21:34:28,456 INFO L279 CegarLoopForPetriNet]: 405 programPoint places, -44 predicate places. [2025-01-09 21:34:28,456 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 0 transitions, 0 flow [2025-01-09 21:34:28,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 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:34:28,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (98 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (97 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (96 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (95 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (94 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (93 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (92 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (91 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (89 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (88 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (87 of 99 remaining) [2025-01-09 21:34:28,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (86 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (85 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (84 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (82 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (81 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (80 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (78 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (77 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (76 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (75 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (74 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (72 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (71 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (70 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (69 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (68 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (67 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (66 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (65 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (64 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (63 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (62 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (61 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (60 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (59 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (58 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (57 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (56 of 99 remaining) [2025-01-09 21:34:28,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (55 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (50 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (47 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (46 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 99 remaining) [2025-01-09 21:34:28,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 99 remaining) [2025-01-09 21:34:28,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 99 remaining) [2025-01-09 21:34:28,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 99 remaining) [2025-01-09 21:34:28,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 99 remaining) [2025-01-09 21:34:28,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (40 of 99 remaining) [2025-01-09 21:34:28,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 99 remaining) [2025-01-09 21:34:28,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (38 of 99 remaining) [2025-01-09 21:34:28,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (37 of 99 remaining) [2025-01-09 21:34:28,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 99 remaining) [2025-01-09 21:34:28,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 99 remaining) [2025-01-09 21:34:28,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 99 remaining) [2025-01-09 21:34:28,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 99 remaining) [2025-01-09 21:34:28,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 99 remaining) [2025-01-09 21:34:28,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (31 of 99 remaining) [2025-01-09 21:34:28,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 99 remaining) [2025-01-09 21:34:28,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (29 of 99 remaining) [2025-01-09 21:34:28,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 99 remaining) [2025-01-09 21:34:28,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (17 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (15 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (13 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (12 of 99 remaining) [2025-01-09 21:34:28,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (11 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (10 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (9 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (8 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (7 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (6 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (5 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (4 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (3 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (2 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (1 of 99 remaining) [2025-01-09 21:34:28,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (0 of 99 remaining) [2025-01-09 21:34:28,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:34:28,469 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] [2025-01-09 21:34:28,473 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:34:28,473 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:34:28,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:34:28 BasicIcfg [2025-01-09 21:34:28,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:34:28,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:34:28,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:34:28,479 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:34:28,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:22" (3/4) ... [2025-01-09 21:34:28,481 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:34:28,483 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:34:28,483 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:34:28,486 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-01-09 21:34:28,487 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:34:28,487 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:34:28,487 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:34:28,564 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:34:28,568 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:34:28,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:34:28,568 INFO L158 Benchmark]: Toolchain (without parser) took 7176.83ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 122.3MB in the beginning and 131.8MB in the end (delta: -9.5MB). Peak memory consumption was 124.6MB. Max. memory is 16.1GB. [2025-01-09 21:34:28,569 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:28,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.16ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:28,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.62ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 106.3MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:28,569 INFO L158 Benchmark]: Boogie Preprocessor took 23.02ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 104.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:28,569 INFO L158 Benchmark]: RCFGBuilder took 517.28ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 72.7MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:34:28,569 INFO L158 Benchmark]: TraceAbstraction took 6336.42ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 72.3MB in the beginning and 137.0MB in the end (delta: -64.7MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2025-01-09 21:34:28,569 INFO L158 Benchmark]: Witness Printer took 88.67ms. Allocated memory is still 302.0MB. Free memory was 137.0MB in the beginning and 131.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:28,570 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.18ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.16ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.62ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 106.3MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.02ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 104.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 517.28ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 72.7MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6336.42ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 72.3MB in the beginning and 137.0MB in the end (delta: -64.7MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * Witness Printer took 88.67ms. Allocated memory is still 302.0MB. Free memory was 137.0MB in the beginning and 131.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: 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: 64]: 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: 66]: 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: 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: 67]: 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: 67]: 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: 69]: 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: 70]: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: 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 5 procedures, 695 locations, 99 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: 6.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1761 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1913 IncrementalHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 95 mSDtfsCounter, 1913 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=850occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2090 NumberOfCodeBlocks, 2090 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2071 ConstructedInterpolants, 0 QuantifiedInterpolants, 2790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:34:28,594 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