./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-misc-1.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/parallel-misc-1.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 faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:07,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:07,668 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:32:07,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:07,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:07,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:07,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:07,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:07,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:07,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:07,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:07,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:07,686 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:07,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:07,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:07,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:07,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:07,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:07,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:07,688 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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2025-01-09 21:32:07,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:07,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:07,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:07,872 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:07,872 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:07,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-01-09 21:32:09,039 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27e5ad234/abda15e59eb74e349d0ef7aa1b3edb64/FLAG5101db416 [2025-01-09 21:32:09,359 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:09,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-01-09 21:32:09,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27e5ad234/abda15e59eb74e349d0ef7aa1b3edb64/FLAG5101db416 [2025-01-09 21:32:09,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27e5ad234/abda15e59eb74e349d0ef7aa1b3edb64 [2025-01-09 21:32:09,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:09,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:09,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:09,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:09,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:09,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e875cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09, skipping insertion in model container [2025-01-09 21:32:09,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:09,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:09,575 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:09,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:09,624 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:09,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09 WrapperNode [2025-01-09 21:32:09,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:09,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:09,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:09,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:09,631 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:32:09" (1/1) ... [2025-01-09 21:32:09,644 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:32:09" (1/1) ... [2025-01-09 21:32:09,673 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 503 [2025-01-09 21:32:09,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:09,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:09,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:09,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:09,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:09,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:09,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:09,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:09,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (1/1) ... [2025-01-09 21:32:09,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:09,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:09,746 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:32:09,751 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:32:09,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:09,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:09,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:09,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:09,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:09,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:09,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:32:09,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:32:09,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:09,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:09,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:32:09,769 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:32:09,922 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:09,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:10,545 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:10,546 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:10,578 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:10,578 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:32:10,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:10 BoogieIcfgContainer [2025-01-09 21:32:10,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:10,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:10,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:10,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:10,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:09" (1/3) ... [2025-01-09 21:32:10,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1327f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:10, skipping insertion in model container [2025-01-09 21:32:10,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:09" (2/3) ... [2025-01-09 21:32:10,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1327f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:10, skipping insertion in model container [2025-01-09 21:32:10,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:10" (3/3) ... [2025-01-09 21:32:10,589 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-01-09 21:32:10,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:10,603 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 674 locations, 1 initial locations, 3 loop locations, and 73 error locations. [2025-01-09 21:32:10,603 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:10,771 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:32:10,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 680 places, 705 transitions, 1424 flow [2025-01-09 21:32:10,956 INFO L124 PetriNetUnfolderBase]: 32/703 cut-off events. [2025-01-09 21:32:10,958 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:32:10,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 703 events. 32/703 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1859 event pairs, 0 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 456. Up to 2 conditions per place. [2025-01-09 21:32:10,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 680 places, 705 transitions, 1424 flow [2025-01-09 21:32:10,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 662 places, 686 transitions, 1384 flow [2025-01-09 21:32:11,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:11,014 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;@2c845fbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:11,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 123 error locations. [2025-01-09 21:32:11,018 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:11,018 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:32:11,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:11,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:11,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:11,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:11,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:11,023 INFO L85 PathProgramCache]: Analyzing trace with hash -426194873, now seen corresponding path program 1 times [2025-01-09 21:32:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:11,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711395188] [2025-01-09 21:32:11,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:11,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:11,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:32:11,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:32:11,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:11,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:11,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:11,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711395188] [2025-01-09 21:32:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711395188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:11,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194885065] [2025-01-09 21:32:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:11,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:11,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:11,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:11,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:11,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 705 [2025-01-09 21:32:11,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 686 transitions, 1384 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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:32:11,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:11,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 705 [2025-01-09 21:32:11,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:11,702 INFO L124 PetriNetUnfolderBase]: 28/1966 cut-off events. [2025-01-09 21:32:11,702 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-01-09 21:32:11,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 1966 events. 28/1966 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 10195 event pairs, 6 based on Foata normal form. 81/1737 useless extension candidates. Maximal degree in co-relation 1769. Up to 32 conditions per place. [2025-01-09 21:32:11,719 INFO L140 encePairwiseOnDemand]: 681/705 looper letters, 19 selfloop transitions, 2 changer transitions 3/664 dead transitions. [2025-01-09 21:32:11,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 664 transitions, 1382 flow [2025-01-09 21:32:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2020 transitions. [2025-01-09 21:32:11,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550827423167849 [2025-01-09 21:32:11,737 INFO L175 Difference]: Start difference. First operand has 662 places, 686 transitions, 1384 flow. Second operand 3 states and 2020 transitions. [2025-01-09 21:32:11,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 664 transitions, 1382 flow [2025-01-09 21:32:11,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 664 transitions, 1374 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:32:11,752 INFO L231 Difference]: Finished difference. Result has 659 places, 661 transitions, 1330 flow [2025-01-09 21:32:11,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=659, PETRI_TRANSITIONS=661} [2025-01-09 21:32:11,757 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -3 predicate places. [2025-01-09 21:32:11,757 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 661 transitions, 1330 flow [2025-01-09 21:32:11,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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:32:11,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:11,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:11,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:11,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:11,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1606248111, now seen corresponding path program 1 times [2025-01-09 21:32:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:11,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832412440] [2025-01-09 21:32:11,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:11,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:32:11,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:32:11,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:11,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:11,796 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:32:11,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:11,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832412440] [2025-01-09 21:32:11,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832412440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:11,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:11,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:11,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282446926] [2025-01-09 21:32:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:11,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:11,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:11,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:11,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:11,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-01-09 21:32:11,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 661 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:32:11,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:11,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-01-09 21:32:11,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:11,967 INFO L124 PetriNetUnfolderBase]: 19/880 cut-off events. [2025-01-09 21:32:11,967 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:32:11,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 880 events. 19/880 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3036 event pairs, 6 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 883. Up to 29 conditions per place. [2025-01-09 21:32:11,976 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/660 dead transitions. [2025-01-09 21:32:11,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 660 transitions, 1360 flow [2025-01-09 21:32:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-01-09 21:32:11,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-01-09 21:32:11,981 INFO L175 Difference]: Start difference. First operand has 659 places, 661 transitions, 1330 flow. Second operand 3 states and 2009 transitions. [2025-01-09 21:32:11,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 660 transitions, 1360 flow [2025-01-09 21:32:11,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 660 transitions, 1356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:11,991 INFO L231 Difference]: Finished difference. Result has 655 places, 660 transitions, 1328 flow [2025-01-09 21:32:11,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1328, PETRI_PLACES=655, PETRI_TRANSITIONS=660} [2025-01-09 21:32:11,992 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -7 predicate places. [2025-01-09 21:32:11,992 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 660 transitions, 1328 flow [2025-01-09 21:32:11,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:32:11,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:11,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:11,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:11,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:11,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1131415960, now seen corresponding path program 1 times [2025-01-09 21:32:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:11,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364395951] [2025-01-09 21:32:11,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:11,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:12,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:32:12,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:32:12,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:12,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:12,068 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:32:12,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:12,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364395951] [2025-01-09 21:32:12,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364395951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:12,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:12,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:12,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262183042] [2025-01-09 21:32:12,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:12,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:12,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:12,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:12,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:12,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 705 [2025-01-09 21:32:12,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 660 transitions, 1328 flow. Second operand has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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:32:12,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:12,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 705 [2025-01-09 21:32:12,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:12,230 INFO L124 PetriNetUnfolderBase]: 13/876 cut-off events. [2025-01-09 21:32:12,230 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-01-09 21:32:12,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 876 events. 13/876 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2707 event pairs, 1 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 854. Up to 11 conditions per place. [2025-01-09 21:32:12,240 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 8 selfloop transitions, 2 changer transitions 0/659 dead transitions. [2025-01-09 21:32:12,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 659 transitions, 1346 flow [2025-01-09 21:32:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2025-01-09 21:32:12,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2025-01-09 21:32:12,244 INFO L175 Difference]: Start difference. First operand has 655 places, 660 transitions, 1328 flow. Second operand 3 states and 2021 transitions. [2025-01-09 21:32:12,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 659 transitions, 1346 flow [2025-01-09 21:32:12,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 659 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:12,253 INFO L231 Difference]: Finished difference. Result has 654 places, 659 transitions, 1326 flow [2025-01-09 21:32:12,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1326, PETRI_PLACES=654, PETRI_TRANSITIONS=659} [2025-01-09 21:32:12,254 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -8 predicate places. [2025-01-09 21:32:12,254 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 659 transitions, 1326 flow [2025-01-09 21:32:12,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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:32:12,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:12,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:12,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:12,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:12,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:12,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1162586777, now seen corresponding path program 1 times [2025-01-09 21:32:12,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:12,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598289116] [2025-01-09 21:32:12,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:12,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:32:12,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:32:12,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:12,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:12,288 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:32:12,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:12,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598289116] [2025-01-09 21:32:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598289116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287869410] [2025-01-09 21:32:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:12,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:12,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:12,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:12,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 705 [2025-01-09 21:32:12,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 659 transitions, 1326 flow. Second operand has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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:32:12,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:12,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 705 [2025-01-09 21:32:12,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:12,415 INFO L124 PetriNetUnfolderBase]: 11/660 cut-off events. [2025-01-09 21:32:12,416 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-01-09 21:32:12,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 660 events. 11/660 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1806 event pairs, 1 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 629. Up to 11 conditions per place. [2025-01-09 21:32:12,421 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 8 selfloop transitions, 2 changer transitions 0/658 dead transitions. [2025-01-09 21:32:12,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 658 transitions, 1344 flow [2025-01-09 21:32:12,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2025-01-09 21:32:12,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2025-01-09 21:32:12,425 INFO L175 Difference]: Start difference. First operand has 654 places, 659 transitions, 1326 flow. Second operand 3 states and 2021 transitions. [2025-01-09 21:32:12,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 658 transitions, 1344 flow [2025-01-09 21:32:12,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 658 transitions, 1340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:12,431 INFO L231 Difference]: Finished difference. Result has 653 places, 658 transitions, 1324 flow [2025-01-09 21:32:12,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1324, PETRI_PLACES=653, PETRI_TRANSITIONS=658} [2025-01-09 21:32:12,432 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -9 predicate places. [2025-01-09 21:32:12,432 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 658 transitions, 1324 flow [2025-01-09 21:32:12,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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:32:12,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:12,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:12,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:12,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:12,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1963321101, now seen corresponding path program 1 times [2025-01-09 21:32:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936883378] [2025-01-09 21:32:12,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:12,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:12,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:32:12,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:32:12,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:12,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:12,464 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:32:12,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:12,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936883378] [2025-01-09 21:32:12,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936883378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:12,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:12,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:12,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126065983] [2025-01-09 21:32:12,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:12,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:12,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:12,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:12,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:12,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-01-09 21:32:12,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 658 transitions, 1324 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:32:12,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:12,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-01-09 21:32:12,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:12,663 INFO L124 PetriNetUnfolderBase]: 22/1525 cut-off events. [2025-01-09 21:32:12,663 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-01-09 21:32:12,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1525 events. 22/1525 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7067 event pairs, 4 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1501. Up to 22 conditions per place. [2025-01-09 21:32:12,674 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/657 dead transitions. [2025-01-09 21:32:12,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 657 transitions, 1352 flow [2025-01-09 21:32:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-01-09 21:32:12,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-01-09 21:32:12,677 INFO L175 Difference]: Start difference. First operand has 653 places, 658 transitions, 1324 flow. Second operand 3 states and 2011 transitions. [2025-01-09 21:32:12,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 657 transitions, 1352 flow [2025-01-09 21:32:12,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 657 transitions, 1348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:12,684 INFO L231 Difference]: Finished difference. Result has 652 places, 657 transitions, 1322 flow [2025-01-09 21:32:12,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=652, PETRI_TRANSITIONS=657} [2025-01-09 21:32:12,686 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -10 predicate places. [2025-01-09 21:32:12,686 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 657 transitions, 1322 flow [2025-01-09 21:32:12,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:32:12,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:12,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:12,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:12,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:12,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 112019019, now seen corresponding path program 1 times [2025-01-09 21:32:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:12,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023525824] [2025-01-09 21:32:12,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:12,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:32:12,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:32:12,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:12,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:12,725 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:32:12,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023525824] [2025-01-09 21:32:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023525824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:12,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:12,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539723434] [2025-01-09 21:32:12,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:12,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:12,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:12,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:12,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:12,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-01-09 21:32:12,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 657 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:32:12,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:12,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-01-09 21:32:12,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:12,849 INFO L124 PetriNetUnfolderBase]: 14/701 cut-off events. [2025-01-09 21:32:12,849 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:32:12,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 701 events. 14/701 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2227 event pairs, 4 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 665. Up to 22 conditions per place. [2025-01-09 21:32:12,854 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/656 dead transitions. [2025-01-09 21:32:12,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 656 transitions, 1350 flow [2025-01-09 21:32:12,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-01-09 21:32:12,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-01-09 21:32:12,857 INFO L175 Difference]: Start difference. First operand has 652 places, 657 transitions, 1322 flow. Second operand 3 states and 2011 transitions. [2025-01-09 21:32:12,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 656 transitions, 1350 flow [2025-01-09 21:32:12,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 656 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:12,864 INFO L231 Difference]: Finished difference. Result has 651 places, 656 transitions, 1320 flow [2025-01-09 21:32:12,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1320, PETRI_PLACES=651, PETRI_TRANSITIONS=656} [2025-01-09 21:32:12,865 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -11 predicate places. [2025-01-09 21:32:12,865 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 656 transitions, 1320 flow [2025-01-09 21:32:12,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:32:12,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:12,867 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:32:12,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:12,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:12,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1072372617, now seen corresponding path program 1 times [2025-01-09 21:32:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:12,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865486553] [2025-01-09 21:32:12,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:12,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:12,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:32:12,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:32:12,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:12,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:12,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:12,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865486553] [2025-01-09 21:32:12,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865486553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:12,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:12,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548812357] [2025-01-09 21:32:12,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:12,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:12,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:12,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:12,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-01-09 21:32:12,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 656 transitions, 1320 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:32:12,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:12,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-01-09 21:32:12,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:13,050 INFO L124 PetriNetUnfolderBase]: 18/874 cut-off events. [2025-01-09 21:32:13,051 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:32:13,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 874 events. 18/874 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3323 event pairs, 6 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 842. Up to 28 conditions per place. [2025-01-09 21:32:13,059 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/655 dead transitions. [2025-01-09 21:32:13,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 655 transitions, 1350 flow [2025-01-09 21:32:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-01-09 21:32:13,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-01-09 21:32:13,062 INFO L175 Difference]: Start difference. First operand has 651 places, 656 transitions, 1320 flow. Second operand 3 states and 2009 transitions. [2025-01-09 21:32:13,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 655 transitions, 1350 flow [2025-01-09 21:32:13,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 655 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:13,070 INFO L231 Difference]: Finished difference. Result has 650 places, 655 transitions, 1318 flow [2025-01-09 21:32:13,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1318, PETRI_PLACES=650, PETRI_TRANSITIONS=655} [2025-01-09 21:32:13,072 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -12 predicate places. [2025-01-09 21:32:13,072 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 655 transitions, 1318 flow [2025-01-09 21:32:13,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:32:13,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:13,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:13,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:13,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:13,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash 492333006, now seen corresponding path program 1 times [2025-01-09 21:32:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314149806] [2025-01-09 21:32:13,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:13,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 21:32:13,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 21:32:13,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:13,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:13,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:32:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:13,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314149806] [2025-01-09 21:32:13,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314149806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:13,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:13,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:13,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161284438] [2025-01-09 21:32:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:13,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:13,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:13,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:13,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:13,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-01-09 21:32:13,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 655 transitions, 1318 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:32:13,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:13,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-01-09 21:32:13,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:13,266 INFO L124 PetriNetUnfolderBase]: 18/873 cut-off events. [2025-01-09 21:32:13,268 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:32:13,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 873 events. 18/873 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3091 event pairs, 6 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 827. Up to 28 conditions per place. [2025-01-09 21:32:13,276 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/654 dead transitions. [2025-01-09 21:32:13,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 654 transitions, 1348 flow [2025-01-09 21:32:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-01-09 21:32:13,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-01-09 21:32:13,280 INFO L175 Difference]: Start difference. First operand has 650 places, 655 transitions, 1318 flow. Second operand 3 states and 2009 transitions. [2025-01-09 21:32:13,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 654 transitions, 1348 flow [2025-01-09 21:32:13,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 654 transitions, 1344 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:13,303 INFO L231 Difference]: Finished difference. Result has 649 places, 654 transitions, 1316 flow [2025-01-09 21:32:13,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=649, PETRI_TRANSITIONS=654} [2025-01-09 21:32:13,305 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -13 predicate places. [2025-01-09 21:32:13,305 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 654 transitions, 1316 flow [2025-01-09 21:32:13,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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:32:13,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:13,306 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] [2025-01-09 21:32:13,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:13,306 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:13,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1348438054, now seen corresponding path program 1 times [2025-01-09 21:32:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:13,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11308590] [2025-01-09 21:32:13,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:13,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:32:13,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:32:13,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:13,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:13,366 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:32:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:13,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11308590] [2025-01-09 21:32:13,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11308590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:13,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:13,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:13,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699660188] [2025-01-09 21:32:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:13,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:13,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:13,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:13,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:13,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 705 [2025-01-09 21:32:13,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 654 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:32:13,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:13,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 705 [2025-01-09 21:32:13,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:13,501 INFO L124 PetriNetUnfolderBase]: 17/1083 cut-off events. [2025-01-09 21:32:13,501 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:32:13,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 1083 events. 17/1083 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4824 event pairs, 3 based on Foata normal form. 0/925 useless extension candidates. Maximal degree in co-relation 1021. Up to 19 conditions per place. [2025-01-09 21:32:13,510 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 10 selfloop transitions, 2 changer transitions 0/653 dead transitions. [2025-01-09 21:32:13,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 653 transitions, 1338 flow [2025-01-09 21:32:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2017 transitions. [2025-01-09 21:32:13,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536643026004729 [2025-01-09 21:32:13,514 INFO L175 Difference]: Start difference. First operand has 649 places, 654 transitions, 1316 flow. Second operand 3 states and 2017 transitions. [2025-01-09 21:32:13,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 653 transitions, 1338 flow [2025-01-09 21:32:13,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 653 transitions, 1334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:13,521 INFO L231 Difference]: Finished difference. Result has 648 places, 653 transitions, 1314 flow [2025-01-09 21:32:13,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1314, PETRI_PLACES=648, PETRI_TRANSITIONS=653} [2025-01-09 21:32:13,522 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -14 predicate places. [2025-01-09 21:32:13,522 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 653 transitions, 1314 flow [2025-01-09 21:32:13,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:32:13,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:13,524 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] [2025-01-09 21:32:13,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:13,524 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:13,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2054871985, now seen corresponding path program 1 times [2025-01-09 21:32:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:13,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285532437] [2025-01-09 21:32:13,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:13,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:32:13,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:32:13,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:13,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:13,548 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:32:13,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:13,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285532437] [2025-01-09 21:32:13,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285532437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:13,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:13,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:13,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874775790] [2025-01-09 21:32:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:13,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:13,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:13,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:13,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 705 [2025-01-09 21:32:13,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 653 transitions, 1314 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:13,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:13,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 705 [2025-01-09 21:32:13,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:13,743 INFO L124 PetriNetUnfolderBase]: 29/1717 cut-off events. [2025-01-09 21:32:13,743 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:32:13,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 1717 events. 29/1717 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 9704 event pairs, 8 based on Foata normal form. 0/1463 useless extension candidates. Maximal degree in co-relation 1661. Up to 32 conditions per place. [2025-01-09 21:32:13,752 INFO L140 encePairwiseOnDemand]: 701/705 looper letters, 10 selfloop transitions, 1 changer transitions 0/650 dead transitions. [2025-01-09 21:32:13,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 650 transitions, 1330 flow [2025-01-09 21:32:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2025-01-09 21:32:13,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9541371158392435 [2025-01-09 21:32:13,756 INFO L175 Difference]: Start difference. First operand has 648 places, 653 transitions, 1314 flow. Second operand 3 states and 2018 transitions. [2025-01-09 21:32:13,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 650 transitions, 1330 flow [2025-01-09 21:32:13,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 650 transitions, 1326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:13,764 INFO L231 Difference]: Finished difference. Result has 645 places, 650 transitions, 1306 flow [2025-01-09 21:32:13,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=645, PETRI_TRANSITIONS=650} [2025-01-09 21:32:13,766 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -17 predicate places. [2025-01-09 21:32:13,766 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 650 transitions, 1306 flow [2025-01-09 21:32:13,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:13,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:13,767 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] [2025-01-09 21:32:13,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:13,767 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:13,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1242829031, now seen corresponding path program 1 times [2025-01-09 21:32:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782540849] [2025-01-09 21:32:13,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:13,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:13,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:32:13,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:32:13,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:13,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:13,813 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:32:13,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:13,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782540849] [2025-01-09 21:32:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782540849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:13,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:13,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:13,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136387867] [2025-01-09 21:32:13,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:13,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:13,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:13,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:13,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:13,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-01-09 21:32:13,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 650 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:32:13,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:13,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-01-09 21:32:13,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:14,004 INFO L124 PetriNetUnfolderBase]: 34/1522 cut-off events. [2025-01-09 21:32:14,004 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-01-09 21:32:14,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 1522 events. 34/1522 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7587 event pairs, 15 based on Foata normal form. 0/1298 useless extension candidates. Maximal degree in co-relation 1480. Up to 46 conditions per place. [2025-01-09 21:32:14,014 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/649 dead transitions. [2025-01-09 21:32:14,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 649 transitions, 1334 flow [2025-01-09 21:32:14,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-01-09 21:32:14,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-01-09 21:32:14,018 INFO L175 Difference]: Start difference. First operand has 645 places, 650 transitions, 1306 flow. Second operand 3 states and 2011 transitions. [2025-01-09 21:32:14,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 649 transitions, 1334 flow [2025-01-09 21:32:14,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 649 transitions, 1333 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:14,025 INFO L231 Difference]: Finished difference. Result has 645 places, 649 transitions, 1307 flow [2025-01-09 21:32:14,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1307, PETRI_PLACES=645, PETRI_TRANSITIONS=649} [2025-01-09 21:32:14,026 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -17 predicate places. [2025-01-09 21:32:14,026 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 649 transitions, 1307 flow [2025-01-09 21:32:14,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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:32:14,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:14,028 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] [2025-01-09 21:32:14,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:14,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:14,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash -822000430, now seen corresponding path program 1 times [2025-01-09 21:32:14,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:14,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760165016] [2025-01-09 21:32:14,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:14,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:14,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 21:32:14,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 21:32:14,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:14,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:14,604 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:32:14,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:14,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760165016] [2025-01-09 21:32:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760165016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:14,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:14,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760598685] [2025-01-09 21:32:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:14,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:32:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:14,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:32:14,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:32:14,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 640 out of 705 [2025-01-09 21:32:14,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 649 transitions, 1307 flow. Second operand has 6 states, 6 states have (on average 641.5) internal successors, (3849), 6 states have internal predecessors, (3849), 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:32:14,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:14,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 640 of 705 [2025-01-09 21:32:14,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,517 INFO L124 PetriNetUnfolderBase]: 244/4162 cut-off events. [2025-01-09 21:32:15,517 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2025-01-09 21:32:15,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4607 conditions, 4162 events. 244/4162 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 32053 event pairs, 168 based on Foata normal form. 0/3508 useless extension candidates. Maximal degree in co-relation 4510. Up to 421 conditions per place. [2025-01-09 21:32:15,539 INFO L140 encePairwiseOnDemand]: 699/705 looper letters, 36 selfloop transitions, 5 changer transitions 0/648 dead transitions. [2025-01-09 21:32:15,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 648 transitions, 1387 flow [2025-01-09 21:32:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:32:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:32:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3882 transitions. [2025-01-09 21:32:15,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9177304964539007 [2025-01-09 21:32:15,545 INFO L175 Difference]: Start difference. First operand has 645 places, 649 transitions, 1307 flow. Second operand 6 states and 3882 transitions. [2025-01-09 21:32:15,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 648 transitions, 1387 flow [2025-01-09 21:32:15,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 648 transitions, 1383 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:15,551 INFO L231 Difference]: Finished difference. Result has 647 places, 648 transitions, 1311 flow [2025-01-09 21:32:15,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1311, PETRI_PLACES=647, PETRI_TRANSITIONS=648} [2025-01-09 21:32:15,553 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -15 predicate places. [2025-01-09 21:32:15,553 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 648 transitions, 1311 flow [2025-01-09 21:32:15,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 641.5) internal successors, (3849), 6 states have internal predecessors, (3849), 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:32:15,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,555 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] [2025-01-09 21:32:15,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:15,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:15,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,556 INFO L85 PathProgramCache]: Analyzing trace with hash 285930206, now seen corresponding path program 1 times [2025-01-09 21:32:15,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990459577] [2025-01-09 21:32:15,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:32:15,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:32:15,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,598 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:32:15,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990459577] [2025-01-09 21:32:15,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990459577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184041429] [2025-01-09 21:32:15,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 705 [2025-01-09 21:32:15,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 648 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 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:32:15,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 705 [2025-01-09 21:32:15,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,771 INFO L124 PetriNetUnfolderBase]: 28/1297 cut-off events. [2025-01-09 21:32:15,771 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:32:15,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 1297 events. 28/1297 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6697 event pairs, 8 based on Foata normal form. 0/1123 useless extension candidates. Maximal degree in co-relation 1351. Up to 44 conditions per place. [2025-01-09 21:32:15,778 INFO L140 encePairwiseOnDemand]: 690/705 looper letters, 25 selfloop transitions, 5 changer transitions 0/641 dead transitions. [2025-01-09 21:32:15,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 641 transitions, 1358 flow [2025-01-09 21:32:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2025-01-09 21:32:15,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.933806146572104 [2025-01-09 21:32:15,782 INFO L175 Difference]: Start difference. First operand has 647 places, 648 transitions, 1311 flow. Second operand 3 states and 1975 transitions. [2025-01-09 21:32:15,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 641 transitions, 1358 flow [2025-01-09 21:32:15,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 641 transitions, 1348 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:32:15,790 INFO L231 Difference]: Finished difference. Result has 635 places, 640 transitions, 1304 flow [2025-01-09 21:32:15,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=635, PETRI_TRANSITIONS=640} [2025-01-09 21:32:15,791 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -27 predicate places. [2025-01-09 21:32:15,791 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 640 transitions, 1304 flow [2025-01-09 21:32:15,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 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:32:15,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:15,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:15,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:15,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash -98936092, now seen corresponding path program 1 times [2025-01-09 21:32:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619600810] [2025-01-09 21:32:15,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:32:15,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:32:15,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:15,823 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:32:15,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:15,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619600810] [2025-01-09 21:32:15,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619600810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:15,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:15,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:15,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822381738] [2025-01-09 21:32:15,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:15,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:15,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:15,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:15,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:15,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 705 [2025-01-09 21:32:15,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 640 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 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:32:15,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:15,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 705 [2025-01-09 21:32:15,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,942 INFO L124 PetriNetUnfolderBase]: 25/876 cut-off events. [2025-01-09 21:32:15,943 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-01-09 21:32:15,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 876 events. 25/876 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3189 event pairs, 8 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 835. Up to 34 conditions per place. [2025-01-09 21:32:15,952 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 15 selfloop transitions, 5 changer transitions 0/638 dead transitions. [2025-01-09 21:32:15,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 638 transitions, 1341 flow [2025-01-09 21:32:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2005 transitions. [2025-01-09 21:32:15,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479905437352246 [2025-01-09 21:32:15,955 INFO L175 Difference]: Start difference. First operand has 635 places, 640 transitions, 1304 flow. Second operand 3 states and 2005 transitions. [2025-01-09 21:32:15,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 638 transitions, 1341 flow [2025-01-09 21:32:15,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 638 transitions, 1336 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:15,963 INFO L231 Difference]: Finished difference. Result has 632 places, 637 transitions, 1312 flow [2025-01-09 21:32:15,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=632, PETRI_TRANSITIONS=637} [2025-01-09 21:32:15,965 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -30 predicate places. [2025-01-09 21:32:15,965 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 637 transitions, 1312 flow [2025-01-09 21:32:15,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 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:32:15,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:15,967 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] [2025-01-09 21:32:15,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:15,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:15,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1791125759, now seen corresponding path program 1 times [2025-01-09 21:32:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423883067] [2025-01-09 21:32:15,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:15,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 21:32:15,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 21:32:15,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:15,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:16,014 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:32:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423883067] [2025-01-09 21:32:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423883067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:16,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:16,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683288007] [2025-01-09 21:32:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:16,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:16,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:16,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:16,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 705 [2025-01-09 21:32:16,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 637 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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:32:16,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:16,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 705 [2025-01-09 21:32:16,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:16,201 INFO L124 PetriNetUnfolderBase]: 40/1573 cut-off events. [2025-01-09 21:32:16,202 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:32:16,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 1573 events. 40/1573 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 7252 event pairs, 2 based on Foata normal form. 0/1371 useless extension candidates. Maximal degree in co-relation 1578. Up to 30 conditions per place. [2025-01-09 21:32:16,213 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 13 selfloop transitions, 6 changer transitions 0/637 dead transitions. [2025-01-09 21:32:16,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 637 transitions, 1352 flow [2025-01-09 21:32:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2025-01-09 21:32:16,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513002364066194 [2025-01-09 21:32:16,216 INFO L175 Difference]: Start difference. First operand has 632 places, 637 transitions, 1312 flow. Second operand 3 states and 2012 transitions. [2025-01-09 21:32:16,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 637 transitions, 1352 flow [2025-01-09 21:32:16,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 637 transitions, 1347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:16,223 INFO L231 Difference]: Finished difference. Result has 630 places, 635 transitions, 1325 flow [2025-01-09 21:32:16,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=630, PETRI_TRANSITIONS=635} [2025-01-09 21:32:16,224 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -32 predicate places. [2025-01-09 21:32:16,224 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 635 transitions, 1325 flow [2025-01-09 21:32:16,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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:32:16,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:16,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:16,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:32:16,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:16,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2043279010, now seen corresponding path program 1 times [2025-01-09 21:32:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:16,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464041195] [2025-01-09 21:32:16,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:16,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:32:16,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:32:16,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:16,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:16,263 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:32:16,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:16,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464041195] [2025-01-09 21:32:16,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464041195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:16,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:16,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:16,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247113832] [2025-01-09 21:32:16,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:16,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:16,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:16,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:16,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:16,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 705 [2025-01-09 21:32:16,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 635 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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:32:16,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:16,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 705 [2025-01-09 21:32:16,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:16,518 INFO L124 PetriNetUnfolderBase]: 53/1813 cut-off events. [2025-01-09 21:32:16,518 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-01-09 21:32:16,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 1813 events. 53/1813 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10925 event pairs, 2 based on Foata normal form. 1/1588 useless extension candidates. Maximal degree in co-relation 1851. Up to 43 conditions per place. [2025-01-09 21:32:16,532 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 12 selfloop transitions, 5 changer transitions 4/636 dead transitions. [2025-01-09 21:32:16,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 636 transitions, 1368 flow [2025-01-09 21:32:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2025-01-09 21:32:16,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513002364066194 [2025-01-09 21:32:16,536 INFO L175 Difference]: Start difference. First operand has 630 places, 635 transitions, 1325 flow. Second operand 3 states and 2012 transitions. [2025-01-09 21:32:16,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 636 transitions, 1368 flow [2025-01-09 21:32:16,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 636 transitions, 1362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:16,545 INFO L231 Difference]: Finished difference. Result has 628 places, 629 transitions, 1323 flow [2025-01-09 21:32:16,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1323, PETRI_PLACES=628, PETRI_TRANSITIONS=629} [2025-01-09 21:32:16,546 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -34 predicate places. [2025-01-09 21:32:16,546 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 629 transitions, 1323 flow [2025-01-09 21:32:16,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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:32:16,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:16,551 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] [2025-01-09 21:32:16,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:32:16,551 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:16,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:16,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1596473083, now seen corresponding path program 1 times [2025-01-09 21:32:16,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:16,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493634223] [2025-01-09 21:32:16,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:16,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:16,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 21:32:16,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 21:32:16,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:16,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:16,594 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:32:16,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:16,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493634223] [2025-01-09 21:32:16,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493634223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:16,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350295438] [2025-01-09 21:32:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:16,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:16,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:16,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:16,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 705 [2025-01-09 21:32:16,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 629 transitions, 1323 flow. Second operand has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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:32:16,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:16,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 705 [2025-01-09 21:32:16,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:17,040 INFO L124 PetriNetUnfolderBase]: 129/3255 cut-off events. [2025-01-09 21:32:17,040 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:17,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3660 conditions, 3255 events. 129/3255 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 25031 event pairs, 4 based on Foata normal form. 0/2879 useless extension candidates. Maximal degree in co-relation 3559. Up to 158 conditions per place. [2025-01-09 21:32:17,068 INFO L140 encePairwiseOnDemand]: 696/705 looper letters, 17 selfloop transitions, 3 changer transitions 0/626 dead transitions. [2025-01-09 21:32:17,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 626 transitions, 1359 flow [2025-01-09 21:32:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2000 transitions. [2025-01-09 21:32:17,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456264775413712 [2025-01-09 21:32:17,071 INFO L175 Difference]: Start difference. First operand has 628 places, 629 transitions, 1323 flow. Second operand 3 states and 2000 transitions. [2025-01-09 21:32:17,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 626 transitions, 1359 flow [2025-01-09 21:32:17,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 626 transitions, 1354 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:17,079 INFO L231 Difference]: Finished difference. Result has 620 places, 624 transitions, 1319 flow [2025-01-09 21:32:17,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1319, PETRI_PLACES=620, PETRI_TRANSITIONS=624} [2025-01-09 21:32:17,080 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -42 predicate places. [2025-01-09 21:32:17,080 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 624 transitions, 1319 flow [2025-01-09 21:32:17,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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:32:17,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:17,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:17,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:32:17,081 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:17,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash -113614416, now seen corresponding path program 1 times [2025-01-09 21:32:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:17,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392950464] [2025-01-09 21:32:17,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:17,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:32:17,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:32:17,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:17,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:17,123 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:32:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392950464] [2025-01-09 21:32:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392950464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:17,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458831111] [2025-01-09 21:32:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:17,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:17,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:17,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:17,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 705 [2025-01-09 21:32:17,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 624 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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:32:17,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:17,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 705 [2025-01-09 21:32:17,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:17,563 INFO L124 PetriNetUnfolderBase]: 122/3768 cut-off events. [2025-01-09 21:32:17,563 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2025-01-09 21:32:17,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4229 conditions, 3768 events. 122/3768 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 31073 event pairs, 20 based on Foata normal form. 0/3397 useless extension candidates. Maximal degree in co-relation 4127. Up to 176 conditions per place. [2025-01-09 21:32:17,593 INFO L140 encePairwiseOnDemand]: 696/705 looper letters, 18 selfloop transitions, 3 changer transitions 0/622 dead transitions. [2025-01-09 21:32:17,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 622 transitions, 1360 flow [2025-01-09 21:32:17,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2001 transitions. [2025-01-09 21:32:17,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9460992907801419 [2025-01-09 21:32:17,596 INFO L175 Difference]: Start difference. First operand has 620 places, 624 transitions, 1319 flow. Second operand 3 states and 2001 transitions. [2025-01-09 21:32:17,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 622 transitions, 1360 flow [2025-01-09 21:32:17,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 622 transitions, 1357 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:17,603 INFO L231 Difference]: Finished difference. Result has 616 places, 619 transitions, 1317 flow [2025-01-09 21:32:17,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=616, PETRI_TRANSITIONS=619} [2025-01-09 21:32:17,604 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -46 predicate places. [2025-01-09 21:32:17,604 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 619 transitions, 1317 flow [2025-01-09 21:32:17,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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:32:17,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:17,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:17,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:32:17,605 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:17,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash -925704745, now seen corresponding path program 1 times [2025-01-09 21:32:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703016603] [2025-01-09 21:32:17,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:17,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:32:17,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:32:17,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:17,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:17,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:17,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703016603] [2025-01-09 21:32:17,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703016603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:17,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:17,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538116543] [2025-01-09 21:32:17,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:17,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:17,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:17,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:17,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 705 [2025-01-09 21:32:17,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 619 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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:32:17,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:17,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 705 [2025-01-09 21:32:17,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:18,645 INFO L124 PetriNetUnfolderBase]: 354/9609 cut-off events. [2025-01-09 21:32:18,645 INFO L125 PetriNetUnfolderBase]: For 59/63 co-relation queries the response was YES. [2025-01-09 21:32:18,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10800 conditions, 9609 events. 354/9609 cut-off events. For 59/63 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 98049 event pairs, 88 based on Foata normal form. 0/8697 useless extension candidates. Maximal degree in co-relation 10698. Up to 467 conditions per place. [2025-01-09 21:32:18,750 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 18 selfloop transitions, 2 changer transitions 0/617 dead transitions. [2025-01-09 21:32:18,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 617 transitions, 1355 flow [2025-01-09 21:32:18,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2003 transitions. [2025-01-09 21:32:18,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9470449172576832 [2025-01-09 21:32:18,753 INFO L175 Difference]: Start difference. First operand has 616 places, 619 transitions, 1317 flow. Second operand 3 states and 2003 transitions. [2025-01-09 21:32:18,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 617 transitions, 1355 flow [2025-01-09 21:32:18,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 617 transitions, 1352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:18,761 INFO L231 Difference]: Finished difference. Result has 612 places, 615 transitions, 1316 flow [2025-01-09 21:32:18,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=612, PETRI_TRANSITIONS=615} [2025-01-09 21:32:18,762 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -50 predicate places. [2025-01-09 21:32:18,762 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 615 transitions, 1316 flow [2025-01-09 21:32:18,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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:32:18,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:18,763 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] [2025-01-09 21:32:18,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:32:18,763 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:18,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 336501026, now seen corresponding path program 1 times [2025-01-09 21:32:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62889346] [2025-01-09 21:32:18,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:18,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:18,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 21:32:18,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:32:18,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:18,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:19,224 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:32:19,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:19,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62889346] [2025-01-09 21:32:19,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62889346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:19,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:19,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:19,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302800028] [2025-01-09 21:32:19,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:19,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:32:19,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:19,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:32:19,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:32:19,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 705 [2025-01-09 21:32:19,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 615 transitions, 1316 flow. Second operand has 6 states, 6 states have (on average 652.6666666666666) internal successors, (3916), 6 states have internal predecessors, (3916), 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:32:19,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:19,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 705 [2025-01-09 21:32:19,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:20,231 INFO L124 PetriNetUnfolderBase]: 233/5969 cut-off events. [2025-01-09 21:32:20,231 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-01-09 21:32:20,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6890 conditions, 5969 events. 233/5969 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 52360 event pairs, 8 based on Foata normal form. 0/5473 useless extension candidates. Maximal degree in co-relation 6784. Up to 228 conditions per place. [2025-01-09 21:32:20,261 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 26 selfloop transitions, 5 changer transitions 0/616 dead transitions. [2025-01-09 21:32:20,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 616 transitions, 1384 flow [2025-01-09 21:32:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:32:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:32:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3940 transitions. [2025-01-09 21:32:20,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314420803782506 [2025-01-09 21:32:20,266 INFO L175 Difference]: Start difference. First operand has 612 places, 615 transitions, 1316 flow. Second operand 6 states and 3940 transitions. [2025-01-09 21:32:20,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 616 transitions, 1384 flow [2025-01-09 21:32:20,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 616 transitions, 1384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:32:20,273 INFO L231 Difference]: Finished difference. Result has 614 places, 612 transitions, 1320 flow [2025-01-09 21:32:20,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1320, PETRI_PLACES=614, PETRI_TRANSITIONS=612} [2025-01-09 21:32:20,274 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -48 predicate places. [2025-01-09 21:32:20,274 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 612 transitions, 1320 flow [2025-01-09 21:32:20,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 652.6666666666666) internal successors, (3916), 6 states have internal predecessors, (3916), 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:32:20,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:20,275 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] [2025-01-09 21:32:20,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:32:20,275 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:20,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1733796674, now seen corresponding path program 1 times [2025-01-09 21:32:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:20,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602469712] [2025-01-09 21:32:20,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:20,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:32:20,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:32:20,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:20,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:20,640 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:32:20,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:20,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602469712] [2025-01-09 21:32:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602469712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:20,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:20,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:20,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871704483] [2025-01-09 21:32:20,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:20,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:32:20,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:20,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:32:20,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:32:20,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 705 [2025-01-09 21:32:20,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 612 transitions, 1320 flow. Second operand has 6 states, 6 states have (on average 652.8333333333334) internal successors, (3917), 6 states have internal predecessors, (3917), 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:32:20,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:20,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 705 [2025-01-09 21:32:20,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:21,377 INFO L124 PetriNetUnfolderBase]: 160/4614 cut-off events. [2025-01-09 21:32:21,377 INFO L125 PetriNetUnfolderBase]: For 62/70 co-relation queries the response was YES. [2025-01-09 21:32:21,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 4614 events. 160/4614 cut-off events. For 62/70 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 39363 event pairs, 0 based on Foata normal form. 0/4242 useless extension candidates. Maximal degree in co-relation 5224. Up to 171 conditions per place. [2025-01-09 21:32:21,412 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 26 selfloop transitions, 5 changer transitions 0/613 dead transitions. [2025-01-09 21:32:21,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 613 transitions, 1388 flow [2025-01-09 21:32:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:32:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:32:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3940 transitions. [2025-01-09 21:32:21,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314420803782506 [2025-01-09 21:32:21,416 INFO L175 Difference]: Start difference. First operand has 614 places, 612 transitions, 1320 flow. Second operand 6 states and 3940 transitions. [2025-01-09 21:32:21,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 613 transitions, 1388 flow [2025-01-09 21:32:21,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 613 transitions, 1378 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:32:21,423 INFO L231 Difference]: Finished difference. Result has 611 places, 609 transitions, 1314 flow [2025-01-09 21:32:21,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1314, PETRI_PLACES=611, PETRI_TRANSITIONS=609} [2025-01-09 21:32:21,425 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -51 predicate places. [2025-01-09 21:32:21,425 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 609 transitions, 1314 flow [2025-01-09 21:32:21,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 652.8333333333334) internal successors, (3917), 6 states have internal predecessors, (3917), 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:32:21,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:21,426 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] [2025-01-09 21:32:21,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:32:21,427 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:21,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash 978878680, now seen corresponding path program 1 times [2025-01-09 21:32:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:21,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757638492] [2025-01-09 21:32:21,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:21,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 21:32:21,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 21:32:21,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:21,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:21,474 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:32:21,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757638492] [2025-01-09 21:32:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757638492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:21,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:21,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:21,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128668954] [2025-01-09 21:32:21,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:21,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:21,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:21,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:21,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:21,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-01-09 21:32:21,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 609 transitions, 1314 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:21,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:21,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-01-09 21:32:21,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:22,108 INFO L124 PetriNetUnfolderBase]: 208/6152 cut-off events. [2025-01-09 21:32:22,108 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-01-09 21:32:22,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 6152 events. 208/6152 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 53523 event pairs, 32 based on Foata normal form. 0/5655 useless extension candidates. Maximal degree in co-relation 6969. Up to 163 conditions per place. [2025-01-09 21:32:22,145 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2025-01-09 21:32:22,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 609 transitions, 1345 flow [2025-01-09 21:32:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-01-09 21:32:22,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-01-09 21:32:22,147 INFO L175 Difference]: Start difference. First operand has 611 places, 609 transitions, 1314 flow. Second operand 3 states and 2015 transitions. [2025-01-09 21:32:22,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 609 transitions, 1345 flow [2025-01-09 21:32:22,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 609 transitions, 1335 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:32:22,154 INFO L231 Difference]: Finished difference. Result has 607 places, 608 transitions, 1306 flow [2025-01-09 21:32:22,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=607, PETRI_TRANSITIONS=608} [2025-01-09 21:32:22,155 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2025-01-09 21:32:22,156 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 608 transitions, 1306 flow [2025-01-09 21:32:22,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:22,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:22,156 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] [2025-01-09 21:32:22,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:32:22,157 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:22,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1657961656, now seen corresponding path program 1 times [2025-01-09 21:32:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:22,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798031864] [2025-01-09 21:32:22,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:22,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 21:32:22,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 21:32:22,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:22,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:22,189 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:32:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798031864] [2025-01-09 21:32:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798031864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:22,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:22,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:22,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350490737] [2025-01-09 21:32:22,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:22,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:22,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:22,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:22,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-01-09 21:32:22,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 608 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:32:22,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:22,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-01-09 21:32:22,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:22,800 INFO L124 PetriNetUnfolderBase]: 132/4345 cut-off events. [2025-01-09 21:32:22,801 INFO L125 PetriNetUnfolderBase]: For 93/101 co-relation queries the response was YES. [2025-01-09 21:32:22,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4909 conditions, 4345 events. 132/4345 cut-off events. For 93/101 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 35893 event pairs, 9 based on Foata normal form. 0/4018 useless extension candidates. Maximal degree in co-relation 4804. Up to 136 conditions per place. [2025-01-09 21:32:22,827 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 12 selfloop transitions, 2 changer transitions 1/608 dead transitions. [2025-01-09 21:32:22,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 608 transitions, 1337 flow [2025-01-09 21:32:22,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-01-09 21:32:22,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-01-09 21:32:22,830 INFO L175 Difference]: Start difference. First operand has 607 places, 608 transitions, 1306 flow. Second operand 3 states and 2015 transitions. [2025-01-09 21:32:22,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 608 transitions, 1337 flow [2025-01-09 21:32:22,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 608 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:22,839 INFO L231 Difference]: Finished difference. Result has 606 places, 607 transitions, 1304 flow [2025-01-09 21:32:22,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=606, PETRI_TRANSITIONS=607} [2025-01-09 21:32:22,840 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -56 predicate places. [2025-01-09 21:32:22,840 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 607 transitions, 1304 flow [2025-01-09 21:32:22,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:32:22,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:22,840 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] [2025-01-09 21:32:22,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:32:22,841 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:22,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:22,845 INFO L85 PathProgramCache]: Analyzing trace with hash 535295004, now seen corresponding path program 1 times [2025-01-09 21:32:22,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:22,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080129402] [2025-01-09 21:32:22,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:22,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:22,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 21:32:22,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 21:32:22,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:22,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:32:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080129402] [2025-01-09 21:32:22,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080129402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:22,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:22,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:22,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309702408] [2025-01-09 21:32:22,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:22,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:22,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:22,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:22,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:22,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 705 [2025-01-09 21:32:22,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 607 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 675.3333333333334) internal successors, (2026), 3 states have internal predecessors, (2026), 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:32:22,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:22,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 705 [2025-01-09 21:32:22,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:24,192 INFO L124 PetriNetUnfolderBase]: 145/6321 cut-off events. [2025-01-09 21:32:24,192 INFO L125 PetriNetUnfolderBase]: For 20/24 co-relation queries the response was YES. [2025-01-09 21:32:24,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6942 conditions, 6321 events. 145/6321 cut-off events. For 20/24 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 54583 event pairs, 4 based on Foata normal form. 0/5861 useless extension candidates. Maximal degree in co-relation 6837. Up to 68 conditions per place. [2025-01-09 21:32:24,287 INFO L140 encePairwiseOnDemand]: 703/705 looper letters, 8 selfloop transitions, 1 changer transitions 0/609 dead transitions. [2025-01-09 21:32:24,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 609 transitions, 1328 flow [2025-01-09 21:32:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2032 transitions. [2025-01-09 21:32:24,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607565011820332 [2025-01-09 21:32:24,290 INFO L175 Difference]: Start difference. First operand has 606 places, 607 transitions, 1304 flow. Second operand 3 states and 2032 transitions. [2025-01-09 21:32:24,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 609 transitions, 1328 flow [2025-01-09 21:32:24,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 609 transitions, 1324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:24,300 INFO L231 Difference]: Finished difference. Result has 606 places, 607 transitions, 1305 flow [2025-01-09 21:32:24,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=606, PETRI_TRANSITIONS=607} [2025-01-09 21:32:24,302 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -56 predicate places. [2025-01-09 21:32:24,302 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 607 transitions, 1305 flow [2025-01-09 21:32:24,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.3333333333334) internal successors, (2026), 3 states have internal predecessors, (2026), 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:32:24,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:24,303 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] [2025-01-09 21:32:24,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:32:24,303 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:24,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash -694023364, now seen corresponding path program 1 times [2025-01-09 21:32:24,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:24,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265670287] [2025-01-09 21:32:24,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:24,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:24,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 21:32:24,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 21:32:24,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:24,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:32:24,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265670287] [2025-01-09 21:32:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265670287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564831425] [2025-01-09 21:32:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:24,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:24,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:24,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:24,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 705 [2025-01-09 21:32:24,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 607 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:32:24,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:24,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 705 [2025-01-09 21:32:24,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:25,122 INFO L124 PetriNetUnfolderBase]: 135/6249 cut-off events. [2025-01-09 21:32:25,123 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-01-09 21:32:25,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6830 conditions, 6249 events. 135/6249 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 52033 event pairs, 8 based on Foata normal form. 0/5823 useless extension candidates. Maximal degree in co-relation 6725. Up to 68 conditions per place. [2025-01-09 21:32:25,166 INFO L140 encePairwiseOnDemand]: 703/705 looper letters, 7 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2025-01-09 21:32:25,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 608 transitions, 1324 flow [2025-01-09 21:32:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2031 transitions. [2025-01-09 21:32:25,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602836879432625 [2025-01-09 21:32:25,169 INFO L175 Difference]: Start difference. First operand has 606 places, 607 transitions, 1305 flow. Second operand 3 states and 2031 transitions. [2025-01-09 21:32:25,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 608 transitions, 1324 flow [2025-01-09 21:32:25,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 608 transitions, 1324 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:32:25,180 INFO L231 Difference]: Finished difference. Result has 608 places, 607 transitions, 1310 flow [2025-01-09 21:32:25,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=608, PETRI_TRANSITIONS=607} [2025-01-09 21:32:25,181 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2025-01-09 21:32:25,181 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 607 transitions, 1310 flow [2025-01-09 21:32:25,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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:32:25,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:25,185 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] [2025-01-09 21:32:25,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:32:25,185 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:25,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1885261626, now seen corresponding path program 1 times [2025-01-09 21:32:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:25,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685097421] [2025-01-09 21:32:25,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:25,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 21:32:25,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 21:32:25,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:25,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:32:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:25,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685097421] [2025-01-09 21:32:25,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685097421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:25,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471756709] [2025-01-09 21:32:25,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:25,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:25,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:25,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:25,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-01-09 21:32:25,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 607 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:25,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:25,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-01-09 21:32:25,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:26,541 INFO L124 PetriNetUnfolderBase]: 231/8833 cut-off events. [2025-01-09 21:32:26,541 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-01-09 21:32:26,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 8833 events. 231/8833 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 80979 event pairs, 36 based on Foata normal form. 0/8203 useless extension candidates. Maximal degree in co-relation 9728. Up to 159 conditions per place. [2025-01-09 21:32:26,582 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2025-01-09 21:32:26,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 607 transitions, 1341 flow [2025-01-09 21:32:26,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-01-09 21:32:26,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-01-09 21:32:26,585 INFO L175 Difference]: Start difference. First operand has 608 places, 607 transitions, 1310 flow. Second operand 3 states and 2015 transitions. [2025-01-09 21:32:26,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 607 transitions, 1341 flow [2025-01-09 21:32:26,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 607 transitions, 1341 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:32:26,590 INFO L231 Difference]: Finished difference. Result has 609 places, 606 transitions, 1312 flow [2025-01-09 21:32:26,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=609, PETRI_TRANSITIONS=606} [2025-01-09 21:32:26,591 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -53 predicate places. [2025-01-09 21:32:26,591 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 606 transitions, 1312 flow [2025-01-09 21:32:26,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:26,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:26,596 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] [2025-01-09 21:32:26,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:32:26,596 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:26,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 144335096, now seen corresponding path program 1 times [2025-01-09 21:32:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407610377] [2025-01-09 21:32:26,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:26,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 21:32:26,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 21:32:26,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:26,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:32:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407610377] [2025-01-09 21:32:26,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407610377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:26,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:26,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:26,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423884953] [2025-01-09 21:32:26,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:26,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:26,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:26,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:26,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:26,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-01-09 21:32:26,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 606 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:32:26,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:26,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-01-09 21:32:26,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:27,237 INFO L124 PetriNetUnfolderBase]: 147/6049 cut-off events. [2025-01-09 21:32:27,237 INFO L125 PetriNetUnfolderBase]: For 105/113 co-relation queries the response was YES. [2025-01-09 21:32:27,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6755 conditions, 6049 events. 147/6049 cut-off events. For 105/113 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 50623 event pairs, 22 based on Foata normal form. 0/5641 useless extension candidates. Maximal degree in co-relation 6648. Up to 150 conditions per place. [2025-01-09 21:32:27,284 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2025-01-09 21:32:27,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 606 transitions, 1343 flow [2025-01-09 21:32:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-01-09 21:32:27,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-01-09 21:32:27,287 INFO L175 Difference]: Start difference. First operand has 609 places, 606 transitions, 1312 flow. Second operand 3 states and 2015 transitions. [2025-01-09 21:32:27,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 606 transitions, 1343 flow [2025-01-09 21:32:27,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 606 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:27,293 INFO L231 Difference]: Finished difference. Result has 608 places, 605 transitions, 1310 flow [2025-01-09 21:32:27,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=608, PETRI_TRANSITIONS=605} [2025-01-09 21:32:27,294 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2025-01-09 21:32:27,294 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 605 transitions, 1310 flow [2025-01-09 21:32:27,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:32:27,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:27,295 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] [2025-01-09 21:32:27,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:32:27,295 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:27,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash 608940959, now seen corresponding path program 1 times [2025-01-09 21:32:27,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:27,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502603034] [2025-01-09 21:32:27,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:27,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 21:32:27,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 21:32:27,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:27,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:32:27,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:27,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502603034] [2025-01-09 21:32:27,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502603034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:27,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:27,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:27,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505836921] [2025-01-09 21:32:27,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:27,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:27,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:27,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:27,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 705 [2025-01-09 21:32:27,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 605 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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:32:27,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:27,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 705 [2025-01-09 21:32:27,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:28,531 INFO L124 PetriNetUnfolderBase]: 281/10327 cut-off events. [2025-01-09 21:32:28,532 INFO L125 PetriNetUnfolderBase]: For 90/94 co-relation queries the response was YES. [2025-01-09 21:32:28,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11638 conditions, 10327 events. 281/10327 cut-off events. For 90/94 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 101476 event pairs, 64 based on Foata normal form. 0/9622 useless extension candidates. Maximal degree in co-relation 11531. Up to 254 conditions per place. [2025-01-09 21:32:28,607 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 20 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2025-01-09 21:32:28,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 605 transitions, 1355 flow [2025-01-09 21:32:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2004 transitions. [2025-01-09 21:32:28,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475177304964539 [2025-01-09 21:32:28,609 INFO L175 Difference]: Start difference. First operand has 608 places, 605 transitions, 1310 flow. Second operand 3 states and 2004 transitions. [2025-01-09 21:32:28,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 605 transitions, 1355 flow [2025-01-09 21:32:28,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 605 transitions, 1351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:28,616 INFO L231 Difference]: Finished difference. Result has 607 places, 604 transitions, 1308 flow [2025-01-09 21:32:28,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1308, PETRI_PLACES=607, PETRI_TRANSITIONS=604} [2025-01-09 21:32:28,617 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2025-01-09 21:32:28,617 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 604 transitions, 1308 flow [2025-01-09 21:32:28,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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:32:28,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:28,618 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] [2025-01-09 21:32:28,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:32:28,618 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:28,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1684965795, now seen corresponding path program 1 times [2025-01-09 21:32:28,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:28,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18377448] [2025-01-09 21:32:28,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:28,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:28,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-09 21:32:28,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-09 21:32:28,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:28,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:32:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:28,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18377448] [2025-01-09 21:32:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18377448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:28,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427914927] [2025-01-09 21:32:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:28,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:28,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:28,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:28,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-01-09 21:32:28,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 604 transitions, 1308 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:28,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:28,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-01-09 21:32:28,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:29,443 INFO L124 PetriNetUnfolderBase]: 163/6447 cut-off events. [2025-01-09 21:32:29,443 INFO L125 PetriNetUnfolderBase]: For 111/119 co-relation queries the response was YES. [2025-01-09 21:32:29,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7257 conditions, 6447 events. 163/6447 cut-off events. For 111/119 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 56658 event pairs, 36 based on Foata normal form. 0/6034 useless extension candidates. Maximal degree in co-relation 7150. Up to 199 conditions per place. [2025-01-09 21:32:29,493 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 15 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2025-01-09 21:32:29,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 604 transitions, 1343 flow [2025-01-09 21:32:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-01-09 21:32:29,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-01-09 21:32:29,496 INFO L175 Difference]: Start difference. First operand has 607 places, 604 transitions, 1308 flow. Second operand 3 states and 2014 transitions. [2025-01-09 21:32:29,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 604 transitions, 1343 flow [2025-01-09 21:32:29,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 604 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:29,502 INFO L231 Difference]: Finished difference. Result has 606 places, 603 transitions, 1306 flow [2025-01-09 21:32:29,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=606, PETRI_TRANSITIONS=603} [2025-01-09 21:32:29,503 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -56 predicate places. [2025-01-09 21:32:29,503 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 603 transitions, 1306 flow [2025-01-09 21:32:29,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:29,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:29,504 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, 1] [2025-01-09 21:32:29,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:32:29,504 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:29,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1045041519, now seen corresponding path program 1 times [2025-01-09 21:32:29,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:29,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465792369] [2025-01-09 21:32:29,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:29,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:29,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-09 21:32:29,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-09 21:32:29,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:29,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:32:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465792369] [2025-01-09 21:32:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465792369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:29,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119937882] [2025-01-09 21:32:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:29,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:29,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:29,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 705 [2025-01-09 21:32:29,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 603 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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:32:29,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:29,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 705 [2025-01-09 21:32:29,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:31,042 INFO L124 PetriNetUnfolderBase]: 283/10615 cut-off events. [2025-01-09 21:32:31,042 INFO L125 PetriNetUnfolderBase]: For 121/129 co-relation queries the response was YES. [2025-01-09 21:32:31,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11964 conditions, 10615 events. 283/10615 cut-off events. For 121/129 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 102896 event pairs, 56 based on Foata normal form. 0/9913 useless extension candidates. Maximal degree in co-relation 11857. Up to 246 conditions per place. [2025-01-09 21:32:31,104 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 20 selfloop transitions, 2 changer transitions 0/603 dead transitions. [2025-01-09 21:32:31,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 603 transitions, 1351 flow [2025-01-09 21:32:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2004 transitions. [2025-01-09 21:32:31,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475177304964539 [2025-01-09 21:32:31,106 INFO L175 Difference]: Start difference. First operand has 606 places, 603 transitions, 1306 flow. Second operand 3 states and 2004 transitions. [2025-01-09 21:32:31,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 603 transitions, 1351 flow [2025-01-09 21:32:31,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 603 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:31,113 INFO L231 Difference]: Finished difference. Result has 605 places, 602 transitions, 1304 flow [2025-01-09 21:32:31,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=605, PETRI_TRANSITIONS=602} [2025-01-09 21:32:31,114 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -57 predicate places. [2025-01-09 21:32:31,114 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 602 transitions, 1304 flow [2025-01-09 21:32:31,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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:32:31,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:31,115 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, 1, 1, 1] [2025-01-09 21:32:31,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:32:31,115 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:31,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash -371323254, now seen corresponding path program 1 times [2025-01-09 21:32:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351934670] [2025-01-09 21:32:31,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:31,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-09 21:32:31,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-09 21:32:31,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:31,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:32:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351934670] [2025-01-09 21:32:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351934670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953404409] [2025-01-09 21:32:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:31,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:31,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:31,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-01-09 21:32:31,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 602 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:31,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:31,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-01-09 21:32:31,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:32,117 INFO L124 PetriNetUnfolderBase]: 233/7345 cut-off events. [2025-01-09 21:32:32,117 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-09 21:32:32,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8396 conditions, 7345 events. 233/7345 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 67058 event pairs, 76 based on Foata normal form. 0/6909 useless extension candidates. Maximal degree in co-relation 8328. Up to 266 conditions per place. [2025-01-09 21:32:32,147 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2025-01-09 21:32:32,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 602 transitions, 1337 flow [2025-01-09 21:32:32,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-01-09 21:32:32,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-01-09 21:32:32,149 INFO L175 Difference]: Start difference. First operand has 605 places, 602 transitions, 1304 flow. Second operand 3 states and 2014 transitions. [2025-01-09 21:32:32,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 602 transitions, 1337 flow [2025-01-09 21:32:32,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 602 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:32,154 INFO L231 Difference]: Finished difference. Result has 604 places, 601 transitions, 1302 flow [2025-01-09 21:32:32,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1302, PETRI_PLACES=604, PETRI_TRANSITIONS=601} [2025-01-09 21:32:32,155 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -58 predicate places. [2025-01-09 21:32:32,155 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 601 transitions, 1302 flow [2025-01-09 21:32:32,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:32,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:32,155 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:32,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:32:32,156 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:32,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash 64554285, now seen corresponding path program 1 times [2025-01-09 21:32:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:32,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774647268] [2025-01-09 21:32:32,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:32,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:32,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 21:32:32,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 21:32:32,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:32,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:32:32,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:32,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774647268] [2025-01-09 21:32:32,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774647268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:32,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:32,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:32,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357427435] [2025-01-09 21:32:32,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:32,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:32,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:32,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:32,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:32,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-01-09 21:32:32,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 601 transitions, 1302 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:32,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:32,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-01-09 21:32:32,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:33,017 INFO L124 PetriNetUnfolderBase]: 155/6417 cut-off events. [2025-01-09 21:32:33,018 INFO L125 PetriNetUnfolderBase]: For 113/121 co-relation queries the response was YES. [2025-01-09 21:32:33,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7189 conditions, 6417 events. 155/6417 cut-off events. For 113/121 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 55605 event pairs, 32 based on Foata normal form. 0/6029 useless extension candidates. Maximal degree in co-relation 7082. Up to 185 conditions per place. [2025-01-09 21:32:33,071 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 15 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2025-01-09 21:32:33,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 601 transitions, 1337 flow [2025-01-09 21:32:33,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-01-09 21:32:33,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-01-09 21:32:33,073 INFO L175 Difference]: Start difference. First operand has 604 places, 601 transitions, 1302 flow. Second operand 3 states and 2014 transitions. [2025-01-09 21:32:33,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 601 transitions, 1337 flow [2025-01-09 21:32:33,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 601 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:33,079 INFO L231 Difference]: Finished difference. Result has 603 places, 600 transitions, 1300 flow [2025-01-09 21:32:33,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=603, PETRI_TRANSITIONS=600} [2025-01-09 21:32:33,080 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -59 predicate places. [2025-01-09 21:32:33,081 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 600 transitions, 1300 flow [2025-01-09 21:32:33,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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:32:33,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:33,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:33,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:32:33,082 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-01-09 21:32:33,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2021710200, now seen corresponding path program 1 times [2025-01-09 21:32:33,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:33,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136668489] [2025-01-09 21:32:33,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:33,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:33,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 21:32:33,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 21:32:33,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:33,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:32:33,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:33,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136668489] [2025-01-09 21:32:33,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136668489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:33,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:33,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:33,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106751576] [2025-01-09 21:32:33,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:33,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:33,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:33,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:33,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:33,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-01-09 21:32:33,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 600 transitions, 1300 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:32:33,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:33,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-01-09 21:32:33,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:33,894 INFO L124 PetriNetUnfolderBase]: 175/6445 cut-off events. [2025-01-09 21:32:33,894 INFO L125 PetriNetUnfolderBase]: For 92/100 co-relation queries the response was YES. [2025-01-09 21:32:33,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 6445 events. 175/6445 cut-off events. For 92/100 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 56858 event pairs, 42 based on Foata normal form. 0/6066 useless extension candidates. Maximal degree in co-relation 7248. Up to 258 conditions per place. [2025-01-09 21:32:33,928 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 0 selfloop transitions, 0 changer transitions 600/600 dead transitions. [2025-01-09 21:32:33,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 600 transitions, 1333 flow [2025-01-09 21:32:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-01-09 21:32:33,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-01-09 21:32:33,930 INFO L175 Difference]: Start difference. First operand has 603 places, 600 transitions, 1300 flow. Second operand 3 states and 2014 transitions. [2025-01-09 21:32:33,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 600 transitions, 1333 flow [2025-01-09 21:32:33,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 600 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:33,936 INFO L231 Difference]: Finished difference. Result has 602 places, 0 transitions, 0 flow [2025-01-09 21:32:33,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=602, PETRI_TRANSITIONS=0} [2025-01-09 21:32:33,936 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -60 predicate places. [2025-01-09 21:32:33,936 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 0 transitions, 0 flow [2025-01-09 21:32:33,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:32:33,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (122 of 123 remaining) [2025-01-09 21:32:33,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (121 of 123 remaining) [2025-01-09 21:32:33,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (120 of 123 remaining) [2025-01-09 21:32:33,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (119 of 123 remaining) [2025-01-09 21:32:33,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (118 of 123 remaining) [2025-01-09 21:32:33,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (117 of 123 remaining) [2025-01-09 21:32:33,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (116 of 123 remaining) [2025-01-09 21:32:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (115 of 123 remaining) [2025-01-09 21:32:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (114 of 123 remaining) [2025-01-09 21:32:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (113 of 123 remaining) [2025-01-09 21:32:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (112 of 123 remaining) [2025-01-09 21:32:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (111 of 123 remaining) [2025-01-09 21:32:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (110 of 123 remaining) [2025-01-09 21:32:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (109 of 123 remaining) [2025-01-09 21:32:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (108 of 123 remaining) [2025-01-09 21:32:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (107 of 123 remaining) [2025-01-09 21:32:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (106 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (105 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (104 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (103 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (102 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (101 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (100 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (99 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (98 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (97 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (96 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (95 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (94 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (93 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (92 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (91 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (90 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (89 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (88 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (87 of 123 remaining) [2025-01-09 21:32:33,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (86 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (85 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (84 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (83 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (82 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (81 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (80 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (78 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (77 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (76 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (75 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (74 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (73 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (72 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (71 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (70 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (69 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (68 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (66 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (65 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (64 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (63 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (61 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (60 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (59 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (58 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (57 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (56 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (55 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (54 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (53 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (52 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (51 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (50 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 123 remaining) [2025-01-09 21:32:33,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (46 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (44 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (41 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (40 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (39 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (38 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (37 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (36 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (32 of 123 remaining) [2025-01-09 21:32:33,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (31 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (30 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (29 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (28 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (27 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (26 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (25 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (24 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (22 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (20 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (16 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (15 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (13 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (10 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (8 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (6 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (5 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (4 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (3 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (2 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (1 of 123 remaining) [2025-01-09 21:32:33,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (0 of 123 remaining) [2025-01-09 21:32:33,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:32:33,948 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:33,956 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:33,960 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:33,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:33 BasicIcfg [2025-01-09 21:32:33,965 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:33,966 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:33,966 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:33,967 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:33,967 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:10" (3/4) ... [2025-01-09 21:32:33,968 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:33,970 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:33,970 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:33,976 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 21:32:33,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:33,978 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:32:33,978 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:34,047 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:34,047 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:34,047 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:34,049 INFO L158 Benchmark]: Toolchain (without parser) took 24650.77ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 126.8MB in the beginning and 1.1GB in the end (delta: -983.1MB). Peak memory consumption was 347.1MB. Max. memory is 16.1GB. [2025-01-09 21:32:34,049 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 226.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:34,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.52ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 113.0MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:34,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.19ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 110.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:34,050 INFO L158 Benchmark]: Boogie Preprocessor took 41.77ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 107.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:34,051 INFO L158 Benchmark]: RCFGBuilder took 862.49ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 62.7MB in the end (delta: 43.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 21:32:34,052 INFO L158 Benchmark]: TraceAbstraction took 23385.36ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 61.8MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 904.9MB. Max. memory is 16.1GB. [2025-01-09 21:32:34,052 INFO L158 Benchmark]: Witness Printer took 81.21ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:34,053 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.28ms. Allocated memory is still 226.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.52ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 113.0MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.19ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 110.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.77ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 107.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 862.49ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 62.7MB in the end (delta: 43.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23385.36ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 61.8MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 904.9MB. Max. memory is 16.1GB. * Witness Printer took 81.21ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 65]: 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: 73]: 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: 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: 87]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: 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, 1100 locations, 123 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: 23.2s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1859 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 664 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 332 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2147 IncrementalHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 332 mSolverCounterUnsat, 327 mSDtfsCounter, 2147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1384occurred in iteration=0, InterpolantAutomatonStates: 108, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 4931 NumberOfCodeBlocks, 4931 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4898 ConstructedInterpolants, 0 QuantifiedInterpolants, 5303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 10/10 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 73 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:34,078 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