./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.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/popl20-more-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:14,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:14,708 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:33:14,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:14,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:14,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:14,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:14,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:14,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:14,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:14,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:14,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:14,731 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:14,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:14,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:14,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:14,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:14,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:14,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:14,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:14,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:14,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:14,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:14,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:14,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:14,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:14,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:14,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:14,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:14,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:14,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:14,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:14,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:14,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:14,734 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2025-01-09 21:33:14,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:14,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:14,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:14,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:14,950 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:14,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-01-09 21:33:16,050 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb04bae9c/b218ed2a1571462ebaea2c7101b71003/FLAGc61780048 [2025-01-09 21:33:16,302 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:16,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-01-09 21:33:16,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb04bae9c/b218ed2a1571462ebaea2c7101b71003/FLAGc61780048 [2025-01-09 21:33:16,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb04bae9c/b218ed2a1571462ebaea2c7101b71003 [2025-01-09 21:33:16,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:16,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:16,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:16,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:16,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:16,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f38fc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16, skipping insertion in model container [2025-01-09 21:33:16,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:16,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:16,799 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:16,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:16,828 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:16,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16 WrapperNode [2025-01-09 21:33:16,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:16,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:16,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:16,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:16,835 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:33:16" (1/1) ... [2025-01-09 21:33:16,841 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:33:16" (1/1) ... [2025-01-09 21:33:16,860 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 359 [2025-01-09 21:33:16,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:16,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:16,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:16,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:16,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:16,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:16,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:16,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:16,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (1/1) ... [2025-01-09 21:33:16,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:16,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:16,934 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:33:16,936 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:33:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:16,955 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:33:17,044 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:17,046 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:17,521 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:17,521 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:17,544 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:17,545 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:17,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:17 BoogieIcfgContainer [2025-01-09 21:33:17,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:17,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:17,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:17,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:17,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:16" (1/3) ... [2025-01-09 21:33:17,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@880b8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:17, skipping insertion in model container [2025-01-09 21:33:17,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:16" (2/3) ... [2025-01-09 21:33:17,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@880b8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:17, skipping insertion in model container [2025-01-09 21:33:17,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:17" (3/3) ... [2025-01-09 21:33:17,554 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-01-09 21:33:17,564 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:17,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 474 locations, 1 initial locations, 5 loop locations, and 30 error locations. [2025-01-09 21:33:17,565 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:17,671 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:17,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 483 places, 500 transitions, 1021 flow [2025-01-09 21:33:17,857 INFO L124 PetriNetUnfolderBase]: 27/497 cut-off events. [2025-01-09 21:33:17,858 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:17,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 497 events. 27/497 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1016 event pairs, 0 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 380. Up to 2 conditions per place. [2025-01-09 21:33:17,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 483 places, 500 transitions, 1021 flow [2025-01-09 21:33:17,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 464 places, 480 transitions, 978 flow [2025-01-09 21:33:17,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:17,886 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;@306f16fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:17,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-01-09 21:33:17,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:17,894 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:33:17,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:17,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:17,895 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] [2025-01-09 21:33:17,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:17,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:17,899 INFO L85 PathProgramCache]: Analyzing trace with hash 770968400, now seen corresponding path program 1 times [2025-01-09 21:33:17,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:17,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689843255] [2025-01-09 21:33:17,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:17,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:17,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:33:17,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:33:17,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:17,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:18,004 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:33:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689843255] [2025-01-09 21:33:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689843255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:18,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:18,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43812934] [2025-01-09 21:33:18,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:18,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:18,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:18,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:18,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 500 [2025-01-09 21:33:18,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 480 transitions, 978 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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:33:18,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:18,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 500 [2025-01-09 21:33:18,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:18,255 INFO L124 PetriNetUnfolderBase]: 20/998 cut-off events. [2025-01-09 21:33:18,255 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-09 21:33:18,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 998 events. 20/998 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4527 event pairs, 7 based on Foata normal form. 53/933 useless extension candidates. Maximal degree in co-relation 757. Up to 31 conditions per place. [2025-01-09 21:33:18,264 INFO L140 encePairwiseOnDemand]: 477/500 looper letters, 13 selfloop transitions, 2 changer transitions 5/459 dead transitions. [2025-01-09 21:33:18,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 459 transitions, 966 flow [2025-01-09 21:33:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1419 transitions. [2025-01-09 21:33:18,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946 [2025-01-09 21:33:18,277 INFO L175 Difference]: Start difference. First operand has 464 places, 480 transitions, 978 flow. Second operand 3 states and 1419 transitions. [2025-01-09 21:33:18,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 459 transitions, 966 flow [2025-01-09 21:33:18,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 459 transitions, 954 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:18,287 INFO L231 Difference]: Finished difference. Result has 459 places, 454 transitions, 918 flow [2025-01-09 21:33:18,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=459, PETRI_TRANSITIONS=454} [2025-01-09 21:33:18,292 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -5 predicate places. [2025-01-09 21:33:18,292 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 454 transitions, 918 flow [2025-01-09 21:33:18,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 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:33:18,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:18,293 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] [2025-01-09 21:33:18,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:18,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:18,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1506564567, now seen corresponding path program 1 times [2025-01-09 21:33:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:18,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541664681] [2025-01-09 21:33:18,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:18,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:18,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:33:18,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:33:18,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:18,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:18,337 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:33:18,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:18,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541664681] [2025-01-09 21:33:18,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541664681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:18,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:18,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:18,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196544949] [2025-01-09 21:33:18,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:18,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:18,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:18,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:18,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:18,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 500 [2025-01-09 21:33:18,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 454 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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:33:18,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:18,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 500 [2025-01-09 21:33:18,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:18,481 INFO L124 PetriNetUnfolderBase]: 14/739 cut-off events. [2025-01-09 21:33:18,481 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:33:18,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 739 events. 14/739 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2723 event pairs, 5 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 747. Up to 28 conditions per place. [2025-01-09 21:33:18,487 INFO L140 encePairwiseOnDemand]: 497/500 looper letters, 14 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2025-01-09 21:33:18,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 453 transitions, 948 flow [2025-01-09 21:33:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2025-01-09 21:33:18,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313333333333333 [2025-01-09 21:33:18,490 INFO L175 Difference]: Start difference. First operand has 459 places, 454 transitions, 918 flow. Second operand 3 states and 1397 transitions. [2025-01-09 21:33:18,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 453 transitions, 948 flow [2025-01-09 21:33:18,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 453 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:18,496 INFO L231 Difference]: Finished difference. Result has 453 places, 453 transitions, 916 flow [2025-01-09 21:33:18,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=916, PETRI_PLACES=453, PETRI_TRANSITIONS=453} [2025-01-09 21:33:18,497 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -11 predicate places. [2025-01-09 21:33:18,497 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 453 transitions, 916 flow [2025-01-09 21:33:18,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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:33:18,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:18,498 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] [2025-01-09 21:33:18,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:18,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:18,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2022038389, now seen corresponding path program 1 times [2025-01-09 21:33:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358113847] [2025-01-09 21:33:18,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:18,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:33:18,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:33:18,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:18,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:18,526 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:33:18,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:18,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358113847] [2025-01-09 21:33:18,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358113847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:18,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:18,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:18,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799770545] [2025-01-09 21:33:18,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:18,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:18,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:18,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:18,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:18,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 500 [2025-01-09 21:33:18,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 453 transitions, 916 flow. Second operand has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 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:33:18,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:18,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 500 [2025-01-09 21:33:18,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:18,727 INFO L124 PetriNetUnfolderBase]: 26/996 cut-off events. [2025-01-09 21:33:18,728 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:33:18,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 996 events. 26/996 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4714 event pairs, 12 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 1018. Up to 48 conditions per place. [2025-01-09 21:33:18,740 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 16 selfloop transitions, 1 changer transitions 0/448 dead transitions. [2025-01-09 21:33:18,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 448 transitions, 940 flow [2025-01-09 21:33:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2025-01-09 21:33:18,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9266666666666666 [2025-01-09 21:33:18,743 INFO L175 Difference]: Start difference. First operand has 453 places, 453 transitions, 916 flow. Second operand 3 states and 1390 transitions. [2025-01-09 21:33:18,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 448 transitions, 940 flow [2025-01-09 21:33:18,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 448 transitions, 936 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:18,749 INFO L231 Difference]: Finished difference. Result has 448 places, 448 transitions, 904 flow [2025-01-09 21:33:18,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=448, PETRI_TRANSITIONS=448} [2025-01-09 21:33:18,750 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -16 predicate places. [2025-01-09 21:33:18,750 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 448 transitions, 904 flow [2025-01-09 21:33:18,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 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:33:18,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:18,751 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] [2025-01-09 21:33:18,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:18,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:18,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1717339874, now seen corresponding path program 1 times [2025-01-09 21:33:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:18,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465887851] [2025-01-09 21:33:18,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:18,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:33:18,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:33:18,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:18,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:18,830 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:33:18,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:18,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465887851] [2025-01-09 21:33:18,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465887851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:18,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593763559] [2025-01-09 21:33:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:18,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:18,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:18,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:18,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:18,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 500 [2025-01-09 21:33:18,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 448 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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:33:18,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:18,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 500 [2025-01-09 21:33:18,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:19,036 INFO L124 PetriNetUnfolderBase]: 31/1090 cut-off events. [2025-01-09 21:33:19,036 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:33:19,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 1090 events. 31/1090 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5407 event pairs, 15 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1111. Up to 48 conditions per place. [2025-01-09 21:33:19,049 INFO L140 encePairwiseOnDemand]: 497/500 looper letters, 12 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2025-01-09 21:33:19,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 447 transitions, 930 flow [2025-01-09 21:33:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1401 transitions. [2025-01-09 21:33:19,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934 [2025-01-09 21:33:19,052 INFO L175 Difference]: Start difference. First operand has 448 places, 448 transitions, 904 flow. Second operand 3 states and 1401 transitions. [2025-01-09 21:33:19,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 447 transitions, 930 flow [2025-01-09 21:33:19,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 447 transitions, 929 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:19,059 INFO L231 Difference]: Finished difference. Result has 448 places, 447 transitions, 905 flow [2025-01-09 21:33:19,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=448, PETRI_TRANSITIONS=447} [2025-01-09 21:33:19,060 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -16 predicate places. [2025-01-09 21:33:19,061 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 447 transitions, 905 flow [2025-01-09 21:33:19,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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:33:19,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:19,062 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] [2025-01-09 21:33:19,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:19,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:19,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:19,062 INFO L85 PathProgramCache]: Analyzing trace with hash 532054998, now seen corresponding path program 1 times [2025-01-09 21:33:19,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:19,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258206027] [2025-01-09 21:33:19,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:19,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:19,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:33:19,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:33:19,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:19,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:19,570 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:33:19,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258206027] [2025-01-09 21:33:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258206027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:19,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004335823] [2025-01-09 21:33:19,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:19,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:19,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:19,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:19,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 500 [2025-01-09 21:33:19,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 447 transitions, 905 flow. Second operand has 6 states, 6 states have (on average 421.5) internal successors, (2529), 6 states have internal predecessors, (2529), 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:33:19,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:19,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 500 [2025-01-09 21:33:19,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:21,563 INFO L124 PetriNetUnfolderBase]: 1895/16546 cut-off events. [2025-01-09 21:33:21,563 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-01-09 21:33:21,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19463 conditions, 16546 events. 1895/16546 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 206290 event pairs, 1520 based on Foata normal form. 0/14670 useless extension candidates. Maximal degree in co-relation 19425. Up to 2811 conditions per place. [2025-01-09 21:33:21,675 INFO L140 encePairwiseOnDemand]: 488/500 looper letters, 46 selfloop transitions, 10 changer transitions 0/445 dead transitions. [2025-01-09 21:33:21,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 445 transitions, 1013 flow [2025-01-09 21:33:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2578 transitions. [2025-01-09 21:33:21,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8593333333333333 [2025-01-09 21:33:21,683 INFO L175 Difference]: Start difference. First operand has 448 places, 447 transitions, 905 flow. Second operand 6 states and 2578 transitions. [2025-01-09 21:33:21,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 445 transitions, 1013 flow [2025-01-09 21:33:21,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 445 transitions, 1009 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:21,692 INFO L231 Difference]: Finished difference. Result has 449 places, 445 transitions, 917 flow [2025-01-09 21:33:21,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=917, PETRI_PLACES=449, PETRI_TRANSITIONS=445} [2025-01-09 21:33:21,695 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -15 predicate places. [2025-01-09 21:33:21,695 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 445 transitions, 917 flow [2025-01-09 21:33:21,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 421.5) internal successors, (2529), 6 states have internal predecessors, (2529), 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:33:21,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:21,697 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] [2025-01-09 21:33:21,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:21,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:21,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash -995402867, now seen corresponding path program 1 times [2025-01-09 21:33:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584530801] [2025-01-09 21:33:21,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:21,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:21,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:33:21,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:33:21,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:21,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:21,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:21,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584530801] [2025-01-09 21:33:21,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584530801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:21,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:21,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347619273] [2025-01-09 21:33:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:21,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:21,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:21,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:21,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 500 [2025-01-09 21:33:21,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 445 transitions, 917 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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:33:21,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:21,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 500 [2025-01-09 21:33:21,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:21,884 INFO L124 PetriNetUnfolderBase]: 25/836 cut-off events. [2025-01-09 21:33:21,884 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:33:21,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 836 events. 25/836 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3407 event pairs, 15 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 865. Up to 40 conditions per place. [2025-01-09 21:33:21,894 INFO L140 encePairwiseOnDemand]: 497/500 looper letters, 12 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2025-01-09 21:33:21,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 444 transitions, 943 flow [2025-01-09 21:33:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1401 transitions. [2025-01-09 21:33:21,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934 [2025-01-09 21:33:21,897 INFO L175 Difference]: Start difference. First operand has 449 places, 445 transitions, 917 flow. Second operand 3 states and 1401 transitions. [2025-01-09 21:33:21,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 444 transitions, 943 flow [2025-01-09 21:33:21,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 444 transitions, 923 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:21,904 INFO L231 Difference]: Finished difference. Result has 445 places, 444 transitions, 899 flow [2025-01-09 21:33:21,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=445, PETRI_TRANSITIONS=444} [2025-01-09 21:33:21,907 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -19 predicate places. [2025-01-09 21:33:21,907 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 444 transitions, 899 flow [2025-01-09 21:33:21,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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:33:21,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:21,908 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] [2025-01-09 21:33:21,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:21,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:21,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2100517968, now seen corresponding path program 1 times [2025-01-09 21:33:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:21,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215370928] [2025-01-09 21:33:21,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:21,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:33:21,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:33:21,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:21,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:21,962 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:33:21,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:21,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215370928] [2025-01-09 21:33:21,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215370928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:21,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:21,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:21,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113042607] [2025-01-09 21:33:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:21,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:21,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:21,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:21,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 500 [2025-01-09 21:33:21,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 444 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 460.0) internal successors, (1380), 3 states have internal predecessors, (1380), 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:33:21,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:21,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 500 [2025-01-09 21:33:21,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:22,138 INFO L124 PetriNetUnfolderBase]: 38/1247 cut-off events. [2025-01-09 21:33:22,139 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:33:22,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1247 events. 38/1247 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6824 event pairs, 20 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 1276. Up to 56 conditions per place. [2025-01-09 21:33:22,152 INFO L140 encePairwiseOnDemand]: 495/500 looper letters, 14 selfloop transitions, 1 changer transitions 0/440 dead transitions. [2025-01-09 21:33:22,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 440 transitions, 921 flow [2025-01-09 21:33:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-01-09 21:33:22,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9306666666666666 [2025-01-09 21:33:22,155 INFO L175 Difference]: Start difference. First operand has 445 places, 444 transitions, 899 flow. Second operand 3 states and 1396 transitions. [2025-01-09 21:33:22,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 440 transitions, 921 flow [2025-01-09 21:33:22,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 440 transitions, 917 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:22,162 INFO L231 Difference]: Finished difference. Result has 441 places, 440 transitions, 889 flow [2025-01-09 21:33:22,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=889, PETRI_PLACES=441, PETRI_TRANSITIONS=440} [2025-01-09 21:33:22,163 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -23 predicate places. [2025-01-09 21:33:22,163 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 440 transitions, 889 flow [2025-01-09 21:33:22,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 460.0) internal successors, (1380), 3 states have internal predecessors, (1380), 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:33:22,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:22,164 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] [2025-01-09 21:33:22,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:22,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:22,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:22,165 INFO L85 PathProgramCache]: Analyzing trace with hash 165110869, now seen corresponding path program 1 times [2025-01-09 21:33:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:22,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297184852] [2025-01-09 21:33:22,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:22,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:22,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:33:22,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:33:22,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:22,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:22,223 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:33:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297184852] [2025-01-09 21:33:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297184852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:22,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:22,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738992005] [2025-01-09 21:33:22,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:22,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:22,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:22,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:22,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:22,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 465 out of 500 [2025-01-09 21:33:22,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 440 transitions, 889 flow. Second operand has 3 states, 3 states have (on average 466.0) internal successors, (1398), 3 states have internal predecessors, (1398), 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:33:22,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:22,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 465 of 500 [2025-01-09 21:33:22,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:22,325 INFO L124 PetriNetUnfolderBase]: 14/773 cut-off events. [2025-01-09 21:33:22,325 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:33:22,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 773 events. 14/773 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2229 event pairs, 2 based on Foata normal form. 1/709 useless extension candidates. Maximal degree in co-relation 771. Up to 12 conditions per place. [2025-01-09 21:33:22,370 INFO L140 encePairwiseOnDemand]: 495/500 looper letters, 8 selfloop transitions, 2 changer transitions 2/440 dead transitions. [2025-01-09 21:33:22,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 440 transitions, 915 flow [2025-01-09 21:33:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1409 transitions. [2025-01-09 21:33:22,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9393333333333334 [2025-01-09 21:33:22,373 INFO L175 Difference]: Start difference. First operand has 441 places, 440 transitions, 889 flow. Second operand 3 states and 1409 transitions. [2025-01-09 21:33:22,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 440 transitions, 915 flow [2025-01-09 21:33:22,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 440 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:22,378 INFO L231 Difference]: Finished difference. Result has 440 places, 436 transitions, 883 flow [2025-01-09 21:33:22,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=883, PETRI_PLACES=440, PETRI_TRANSITIONS=436} [2025-01-09 21:33:22,379 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -24 predicate places. [2025-01-09 21:33:22,380 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 436 transitions, 883 flow [2025-01-09 21:33:22,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 466.0) internal successors, (1398), 3 states have internal predecessors, (1398), 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:33:22,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:22,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:22,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:22,381 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:22,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash -242207721, now seen corresponding path program 1 times [2025-01-09 21:33:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:22,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859366460] [2025-01-09 21:33:22,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:22,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:33:22,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:33:22,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:22,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:22,431 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:33:22,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:22,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859366460] [2025-01-09 21:33:22,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859366460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:22,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:22,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798617408] [2025-01-09 21:33:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:22,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:22,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:22,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:22,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:22,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 500 [2025-01-09 21:33:22,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 436 transitions, 883 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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:33:22,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:22,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 500 [2025-01-09 21:33:22,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:22,677 INFO L124 PetriNetUnfolderBase]: 114/2761 cut-off events. [2025-01-09 21:33:22,678 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:33:22,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 2761 events. 114/2761 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 21978 event pairs, 22 based on Foata normal form. 0/2496 useless extension candidates. Maximal degree in co-relation 2917. Up to 159 conditions per place. [2025-01-09 21:33:22,700 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 16 selfloop transitions, 3 changer transitions 0/440 dead transitions. [2025-01-09 21:33:22,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 440 transitions, 933 flow [2025-01-09 21:33:22,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1408 transitions. [2025-01-09 21:33:22,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386666666666666 [2025-01-09 21:33:22,703 INFO L175 Difference]: Start difference. First operand has 440 places, 436 transitions, 883 flow. Second operand 3 states and 1408 transitions. [2025-01-09 21:33:22,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 440 transitions, 933 flow [2025-01-09 21:33:22,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 440 transitions, 929 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:22,710 INFO L231 Difference]: Finished difference. Result has 436 places, 436 transitions, 894 flow [2025-01-09 21:33:22,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=436, PETRI_TRANSITIONS=436} [2025-01-09 21:33:22,711 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -28 predicate places. [2025-01-09 21:33:22,712 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 436 transitions, 894 flow [2025-01-09 21:33:22,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 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:33:22,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:22,713 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] [2025-01-09 21:33:22,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:22,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:22,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash 219332347, now seen corresponding path program 1 times [2025-01-09 21:33:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:22,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16886233] [2025-01-09 21:33:22,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:22,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 21:33:22,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 21:33:22,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:22,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:22,841 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:33:22,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:22,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16886233] [2025-01-09 21:33:22,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16886233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:22,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:22,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:33:22,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97013245] [2025-01-09 21:33:22,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:22,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:33:22,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:22,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:33:22,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:33:23,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 500 [2025-01-09 21:33:23,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 436 transitions, 894 flow. Second operand has 7 states, 7 states have (on average 451.0) internal successors, (3157), 7 states have internal predecessors, (3157), 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:33:23,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:23,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 500 [2025-01-09 21:33:23,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:23,381 INFO L124 PetriNetUnfolderBase]: 64/2041 cut-off events. [2025-01-09 21:33:23,381 INFO L125 PetriNetUnfolderBase]: For 7/19 co-relation queries the response was YES. [2025-01-09 21:33:23,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2245 conditions, 2041 events. 64/2041 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 12723 event pairs, 16 based on Foata normal form. 4/1879 useless extension candidates. Maximal degree in co-relation 2205. Up to 58 conditions per place. [2025-01-09 21:33:23,395 INFO L140 encePairwiseOnDemand]: 479/500 looper letters, 29 selfloop transitions, 28 changer transitions 0/464 dead transitions. [2025-01-09 21:33:23,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 464 transitions, 1071 flow [2025-01-09 21:33:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:33:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:33:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4538 transitions. [2025-01-09 21:33:23,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9076 [2025-01-09 21:33:23,401 INFO L175 Difference]: Start difference. First operand has 436 places, 436 transitions, 894 flow. Second operand 10 states and 4538 transitions. [2025-01-09 21:33:23,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 464 transitions, 1071 flow [2025-01-09 21:33:23,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 464 transitions, 1071 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:23,406 INFO L231 Difference]: Finished difference. Result has 449 places, 452 transitions, 1023 flow [2025-01-09 21:33:23,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1023, PETRI_PLACES=449, PETRI_TRANSITIONS=452} [2025-01-09 21:33:23,407 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -15 predicate places. [2025-01-09 21:33:23,408 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 452 transitions, 1023 flow [2025-01-09 21:33:23,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 451.0) internal successors, (3157), 7 states have internal predecessors, (3157), 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:33:23,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:23,409 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] [2025-01-09 21:33:23,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:23,409 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:23,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash 782644879, now seen corresponding path program 1 times [2025-01-09 21:33:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:23,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836426315] [2025-01-09 21:33:23,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:23,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:23,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 21:33:23,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 21:33:23,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:23,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:23,505 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:33:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836426315] [2025-01-09 21:33:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836426315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:23,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252012908] [2025-01-09 21:33:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:23,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:33:23,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:23,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:33:23,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:33:23,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 500 [2025-01-09 21:33:23,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 452 transitions, 1023 flow. Second operand has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 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:33:23,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:23,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 500 [2025-01-09 21:33:23,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:23,814 INFO L124 PetriNetUnfolderBase]: 99/2466 cut-off events. [2025-01-09 21:33:23,814 INFO L125 PetriNetUnfolderBase]: For 61/70 co-relation queries the response was YES. [2025-01-09 21:33:23,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 2466 events. 99/2466 cut-off events. For 61/70 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 16759 event pairs, 34 based on Foata normal form. 8/2277 useless extension candidates. Maximal degree in co-relation 2758. Up to 103 conditions per place. [2025-01-09 21:33:23,844 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 22 selfloop transitions, 5 changer transitions 0/462 dead transitions. [2025-01-09 21:33:23,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 462 transitions, 1104 flow [2025-01-09 21:33:23,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:33:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:33:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2323 transitions. [2025-01-09 21:33:23,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9292 [2025-01-09 21:33:23,848 INFO L175 Difference]: Start difference. First operand has 449 places, 452 transitions, 1023 flow. Second operand 5 states and 2323 transitions. [2025-01-09 21:33:23,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 462 transitions, 1104 flow [2025-01-09 21:33:23,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 462 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:23,855 INFO L231 Difference]: Finished difference. Result has 455 places, 454 transitions, 1048 flow [2025-01-09 21:33:23,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1048, PETRI_PLACES=455, PETRI_TRANSITIONS=454} [2025-01-09 21:33:23,857 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -9 predicate places. [2025-01-09 21:33:23,857 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 454 transitions, 1048 flow [2025-01-09 21:33:23,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 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:33:23,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:23,859 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:33:23,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:23,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:23,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash 745082766, now seen corresponding path program 1 times [2025-01-09 21:33:23,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:23,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673366103] [2025-01-09 21:33:23,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:23,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:23,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 21:33:23,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 21:33:23,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:23,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:24,174 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:33:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:24,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673366103] [2025-01-09 21:33:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673366103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:24,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429706230] [2025-01-09 21:33:24,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:24,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:24,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:24,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:24,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 500 [2025-01-09 21:33:24,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 454 transitions, 1048 flow. Second operand has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 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:33:24,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:24,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 500 [2025-01-09 21:33:24,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:24,730 INFO L124 PetriNetUnfolderBase]: 116/2548 cut-off events. [2025-01-09 21:33:24,730 INFO L125 PetriNetUnfolderBase]: For 143/152 co-relation queries the response was YES. [2025-01-09 21:33:24,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 2548 events. 116/2548 cut-off events. For 143/152 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 17068 event pairs, 31 based on Foata normal form. 0/2349 useless extension candidates. Maximal degree in co-relation 2972. Up to 140 conditions per place. [2025-01-09 21:33:24,765 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 28 selfloop transitions, 5 changer transitions 0/461 dead transitions. [2025-01-09 21:33:24,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 461 transitions, 1136 flow [2025-01-09 21:33:24,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2025-01-09 21:33:24,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-01-09 21:33:24,769 INFO L175 Difference]: Start difference. First operand has 455 places, 454 transitions, 1048 flow. Second operand 6 states and 2750 transitions. [2025-01-09 21:33:24,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 461 transitions, 1136 flow [2025-01-09 21:33:24,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 461 transitions, 1131 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:24,775 INFO L231 Difference]: Finished difference. Result has 457 places, 453 transitions, 1051 flow [2025-01-09 21:33:24,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=457, PETRI_TRANSITIONS=453} [2025-01-09 21:33:24,776 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -7 predicate places. [2025-01-09 21:33:24,776 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 453 transitions, 1051 flow [2025-01-09 21:33:24,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 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:33:24,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:24,777 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:33:24,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:24,778 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:24,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1234959792, now seen corresponding path program 1 times [2025-01-09 21:33:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:24,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6621625] [2025-01-09 21:33:24,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:24,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:24,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:33:24,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:33:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:24,812 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:33:24,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:24,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6621625] [2025-01-09 21:33:24,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6621625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:24,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:24,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642326998] [2025-01-09 21:33:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:24,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:24,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:24,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:24,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:24,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 500 [2025-01-09 21:33:24,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 453 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 463.6666666666667) internal successors, (1391), 3 states have internal predecessors, (1391), 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:33:24,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:24,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 500 [2025-01-09 21:33:24,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:25,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L64-6-->L65: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][226], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 8#L65true, 553#(= |#race~B~0| 0), Black: 513#true, 494#(= |#race~N~0| 0), 517#true, 515#(= |#race~A~0| 0), 432#L56true, 61#L48-2true, 545#true, Black: 523#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 522#(<= ~N~0 0), 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0), 388#L86-4true]) [2025-01-09 21:33:25,599 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-01-09 21:33:25,599 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-01-09 21:33:25,599 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-01-09 21:33:25,599 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is cut-off event [2025-01-09 21:33:25,653 INFO L124 PetriNetUnfolderBase]: 264/6416 cut-off events. [2025-01-09 21:33:25,653 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-01-09 21:33:25,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7142 conditions, 6416 events. 264/6416 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 60826 event pairs, 47 based on Foata normal form. 0/5925 useless extension candidates. Maximal degree in co-relation 7093. Up to 312 conditions per place. [2025-01-09 21:33:25,708 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 16 selfloop transitions, 3 changer transitions 0/457 dead transitions. [2025-01-09 21:33:25,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 457 transitions, 1101 flow [2025-01-09 21:33:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1408 transitions. [2025-01-09 21:33:25,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386666666666666 [2025-01-09 21:33:25,710 INFO L175 Difference]: Start difference. First operand has 457 places, 453 transitions, 1051 flow. Second operand 3 states and 1408 transitions. [2025-01-09 21:33:25,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 457 transitions, 1101 flow [2025-01-09 21:33:25,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 457 transitions, 1091 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:25,717 INFO L231 Difference]: Finished difference. Result has 452 places, 453 transitions, 1056 flow [2025-01-09 21:33:25,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=452, PETRI_TRANSITIONS=453} [2025-01-09 21:33:25,718 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -12 predicate places. [2025-01-09 21:33:25,719 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 453 transitions, 1056 flow [2025-01-09 21:33:25,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.6666666666667) internal successors, (1391), 3 states have internal predecessors, (1391), 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:33:25,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:25,719 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] [2025-01-09 21:33:25,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:25,720 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:25,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:25,720 INFO L85 PathProgramCache]: Analyzing trace with hash -62395614, now seen corresponding path program 1 times [2025-01-09 21:33:25,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:25,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523139207] [2025-01-09 21:33:25,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:25,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:25,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:33:25,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:33:25,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:25,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:26,085 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:33:26,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:26,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523139207] [2025-01-09 21:33:26,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523139207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:26,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:26,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:26,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269469681] [2025-01-09 21:33:26,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:26,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:26,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:26,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:26,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:26,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 500 [2025-01-09 21:33:26,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 453 transitions, 1056 flow. Second operand has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 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:33:26,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:26,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 500 [2025-01-09 21:33:26,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:26,830 INFO L124 PetriNetUnfolderBase]: 330/3752 cut-off events. [2025-01-09 21:33:26,831 INFO L125 PetriNetUnfolderBase]: For 228/320 co-relation queries the response was YES. [2025-01-09 21:33:26,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4620 conditions, 3752 events. 330/3752 cut-off events. For 228/320 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 31393 event pairs, 59 based on Foata normal form. 0/3501 useless extension candidates. Maximal degree in co-relation 4570. Up to 211 conditions per place. [2025-01-09 21:33:26,852 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 26 selfloop transitions, 5 changer transitions 0/460 dead transitions. [2025-01-09 21:33:26,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 460 transitions, 1140 flow [2025-01-09 21:33:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2025-01-09 21:33:26,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-01-09 21:33:26,855 INFO L175 Difference]: Start difference. First operand has 452 places, 453 transitions, 1056 flow. Second operand 6 states and 2750 transitions. [2025-01-09 21:33:26,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 460 transitions, 1140 flow [2025-01-09 21:33:26,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 460 transitions, 1140 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:26,860 INFO L231 Difference]: Finished difference. Result has 456 places, 452 transitions, 1064 flow [2025-01-09 21:33:26,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1064, PETRI_PLACES=456, PETRI_TRANSITIONS=452} [2025-01-09 21:33:26,861 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -8 predicate places. [2025-01-09 21:33:26,861 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 452 transitions, 1064 flow [2025-01-09 21:33:26,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 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:33:26,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:26,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:26,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:26,862 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:26,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:26,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1837135412, now seen corresponding path program 1 times [2025-01-09 21:33:26,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:26,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098817592] [2025-01-09 21:33:26,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:26,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 21:33:26,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 21:33:26,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:26,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:33:27,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:27,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098817592] [2025-01-09 21:33:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098817592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:27,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:27,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334289481] [2025-01-09 21:33:27,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:27,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:27,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:27,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 500 [2025-01-09 21:33:27,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 452 transitions, 1064 flow. Second operand has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 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:33:27,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:27,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 500 [2025-01-09 21:33:27,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:27,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1226] L55-4-->L56: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][228], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 8#L65true, 553#(= |#race~B~0| 0), Black: 513#true, 494#(= |#race~N~0| 0), 555#true, Black: 551#true, 561#true, 517#true, 515#(= |#race~A~0| 0), 432#L56true, Black: 523#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 509#(= |#race~M~0| 0), Black: 522#(<= ~N~0 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 371#L87-1true, Black: 541#(<= (+ ~M~0 1) 0)]) [2025-01-09 21:33:27,869 INFO L294 olderBase$Statistics]: this new event has 334 ancestors and is cut-off event [2025-01-09 21:33:27,869 INFO L297 olderBase$Statistics]: existing Event has 265 ancestors and is cut-off event [2025-01-09 21:33:27,869 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2025-01-09 21:33:27,869 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2025-01-09 21:33:27,886 INFO L124 PetriNetUnfolderBase]: 180/3691 cut-off events. [2025-01-09 21:33:27,886 INFO L125 PetriNetUnfolderBase]: For 162/171 co-relation queries the response was YES. [2025-01-09 21:33:27,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4430 conditions, 3691 events. 180/3691 cut-off events. For 162/171 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 28898 event pairs, 47 based on Foata normal form. 0/3441 useless extension candidates. Maximal degree in co-relation 4379. Up to 155 conditions per place. [2025-01-09 21:33:27,932 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 28 selfloop transitions, 5 changer transitions 0/459 dead transitions. [2025-01-09 21:33:27,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 459 transitions, 1152 flow [2025-01-09 21:33:27,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2025-01-09 21:33:27,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-01-09 21:33:27,935 INFO L175 Difference]: Start difference. First operand has 456 places, 452 transitions, 1064 flow. Second operand 6 states and 2750 transitions. [2025-01-09 21:33:27,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 459 transitions, 1152 flow [2025-01-09 21:33:27,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 459 transitions, 1142 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:27,941 INFO L231 Difference]: Finished difference. Result has 455 places, 451 transitions, 1062 flow [2025-01-09 21:33:27,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1062, PETRI_PLACES=455, PETRI_TRANSITIONS=451} [2025-01-09 21:33:27,942 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -9 predicate places. [2025-01-09 21:33:27,943 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 451 transitions, 1062 flow [2025-01-09 21:33:27,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 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:33:27,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:27,944 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] [2025-01-09 21:33:27,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:27,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:27,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:27,944 INFO L85 PathProgramCache]: Analyzing trace with hash 905096648, now seen corresponding path program 1 times [2025-01-09 21:33:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:27,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829478235] [2025-01-09 21:33:27,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:27,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 21:33:27,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:33:27,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:27,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:28,196 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:33:28,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:28,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829478235] [2025-01-09 21:33:28,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829478235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:28,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:28,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:28,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052637174] [2025-01-09 21:33:28,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:28,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:28,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:28,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:28,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:28,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 500 [2025-01-09 21:33:28,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 451 transitions, 1062 flow. Second operand has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 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:33:28,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:28,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 500 [2025-01-09 21:33:28,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:28,867 INFO L124 PetriNetUnfolderBase]: 253/3511 cut-off events. [2025-01-09 21:33:28,867 INFO L125 PetriNetUnfolderBase]: For 168/275 co-relation queries the response was YES. [2025-01-09 21:33:28,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4221 conditions, 3511 events. 253/3511 cut-off events. For 168/275 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 28606 event pairs, 59 based on Foata normal form. 0/3276 useless extension candidates. Maximal degree in co-relation 4170. Up to 216 conditions per place. [2025-01-09 21:33:28,901 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 26 selfloop transitions, 5 changer transitions 14/458 dead transitions. [2025-01-09 21:33:28,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 458 transitions, 1146 flow [2025-01-09 21:33:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2025-01-09 21:33:28,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-01-09 21:33:28,904 INFO L175 Difference]: Start difference. First operand has 455 places, 451 transitions, 1062 flow. Second operand 6 states and 2750 transitions. [2025-01-09 21:33:28,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 458 transitions, 1146 flow [2025-01-09 21:33:28,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 458 transitions, 1136 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:28,909 INFO L231 Difference]: Finished difference. Result has 454 places, 436 transitions, 989 flow [2025-01-09 21:33:28,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=989, PETRI_PLACES=454, PETRI_TRANSITIONS=436} [2025-01-09 21:33:28,910 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -10 predicate places. [2025-01-09 21:33:28,910 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 436 transitions, 989 flow [2025-01-09 21:33:28,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 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:33:28,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:28,911 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] [2025-01-09 21:33:28,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:28,911 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:28,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash 863218100, now seen corresponding path program 1 times [2025-01-09 21:33:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:28,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450466557] [2025-01-09 21:33:28,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:28,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 21:33:28,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 21:33:28,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:28,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:33:29,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450466557] [2025-01-09 21:33:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450466557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:29,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793355374] [2025-01-09 21:33:29,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:29,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:29,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:29,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 500 [2025-01-09 21:33:29,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 436 transitions, 989 flow. Second operand has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 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:33:29,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 500 [2025-01-09 21:33:29,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,743 INFO L124 PetriNetUnfolderBase]: 130/2468 cut-off events. [2025-01-09 21:33:29,743 INFO L125 PetriNetUnfolderBase]: For 31/43 co-relation queries the response was YES. [2025-01-09 21:33:29,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3002 conditions, 2468 events. 130/2468 cut-off events. For 31/43 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 17846 event pairs, 21 based on Foata normal form. 2/2339 useless extension candidates. Maximal degree in co-relation 2951. Up to 76 conditions per place. [2025-01-09 21:33:29,762 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 26 selfloop transitions, 5 changer transitions 0/443 dead transitions. [2025-01-09 21:33:29,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 443 transitions, 1073 flow [2025-01-09 21:33:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2025-01-09 21:33:29,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-01-09 21:33:29,766 INFO L175 Difference]: Start difference. First operand has 454 places, 436 transitions, 989 flow. Second operand 6 states and 2750 transitions. [2025-01-09 21:33:29,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 443 transitions, 1073 flow [2025-01-09 21:33:29,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 443 transitions, 1025 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-01-09 21:33:29,772 INFO L231 Difference]: Finished difference. Result has 442 places, 435 transitions, 949 flow [2025-01-09 21:33:29,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=442, PETRI_TRANSITIONS=435} [2025-01-09 21:33:29,773 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -22 predicate places. [2025-01-09 21:33:29,773 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 435 transitions, 949 flow [2025-01-09 21:33:29,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 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:33:29,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,774 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] [2025-01-09 21:33:29,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:29,774 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:29,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2090116518, now seen corresponding path program 1 times [2025-01-09 21:33:29,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361034402] [2025-01-09 21:33:29,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:33:29,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:33:29,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:33:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361034402] [2025-01-09 21:33:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361034402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:30,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:30,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701430676] [2025-01-09 21:33:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:30,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:30,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:30,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:30,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 500 [2025-01-09 21:33:30,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 435 transitions, 949 flow. Second operand has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 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:33:30,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 500 [2025-01-09 21:33:30,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:30,562 INFO L124 PetriNetUnfolderBase]: 110/2442 cut-off events. [2025-01-09 21:33:30,563 INFO L125 PetriNetUnfolderBase]: For 15/37 co-relation queries the response was YES. [2025-01-09 21:33:30,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 2442 events. 110/2442 cut-off events. For 15/37 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 17527 event pairs, 21 based on Foata normal form. 8/2313 useless extension candidates. Maximal degree in co-relation 2811. Up to 76 conditions per place. [2025-01-09 21:33:30,588 INFO L140 encePairwiseOnDemand]: 494/500 looper letters, 26 selfloop transitions, 5 changer transitions 0/442 dead transitions. [2025-01-09 21:33:30,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 442 transitions, 1033 flow [2025-01-09 21:33:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2750 transitions. [2025-01-09 21:33:30,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-01-09 21:33:30,591 INFO L175 Difference]: Start difference. First operand has 442 places, 435 transitions, 949 flow. Second operand 6 states and 2750 transitions. [2025-01-09 21:33:30,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 442 transitions, 1033 flow [2025-01-09 21:33:30,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 442 transitions, 1023 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:30,596 INFO L231 Difference]: Finished difference. Result has 441 places, 434 transitions, 947 flow [2025-01-09 21:33:30,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=947, PETRI_PLACES=441, PETRI_TRANSITIONS=434} [2025-01-09 21:33:30,597 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -23 predicate places. [2025-01-09 21:33:30,597 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 434 transitions, 947 flow [2025-01-09 21:33:30,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 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:33:30,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:30,598 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] [2025-01-09 21:33:30,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:33:30,598 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:33:30,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1994366217, now seen corresponding path program 1 times [2025-01-09 21:33:30,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:30,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004105901] [2025-01-09 21:33:30,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:30,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 21:33:30,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 21:33:30,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:30,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:33:30,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:30,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004105901] [2025-01-09 21:33:30,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004105901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:30,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:30,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:30,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676566955] [2025-01-09 21:33:30,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:30,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:30,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:30,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:30,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:30,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 465 out of 500 [2025-01-09 21:33:30,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 434 transitions, 947 flow. Second operand has 3 states, 3 states have (on average 466.6666666666667) internal successors, (1400), 3 states have internal predecessors, (1400), 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:33:30,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 465 of 500 [2025-01-09 21:33:30,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:30,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L64-6-->L65: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][237], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 579#true, 8#L65true, 553#(= |#race~B~0| 0), Black: 513#true, 494#(= |#race~N~0| 0), Black: 551#true, 515#(= |#race~A~0| 0), 61#L48-2true, 432#L56true, 585#true, 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 388#L86-4true, Black: 541#(<= (+ ~M~0 1) 0)]) [2025-01-09 21:33:30,950 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is cut-off event [2025-01-09 21:33:30,950 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2025-01-09 21:33:30,951 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-01-09 21:33:30,951 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-01-09 21:33:31,013 INFO L124 PetriNetUnfolderBase]: 112/3267 cut-off events. [2025-01-09 21:33:31,014 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2025-01-09 21:33:31,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3650 conditions, 3267 events. 112/3267 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 23821 event pairs, 29 based on Foata normal form. 1/3081 useless extension candidates. Maximal degree in co-relation 3607. Up to 87 conditions per place. [2025-01-09 21:33:31,032 INFO L140 encePairwiseOnDemand]: 497/500 looper letters, 0 selfloop transitions, 0 changer transitions 435/435 dead transitions. [2025-01-09 21:33:31,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 435 transitions, 975 flow [2025-01-09 21:33:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1408 transitions. [2025-01-09 21:33:31,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386666666666666 [2025-01-09 21:33:31,034 INFO L175 Difference]: Start difference. First operand has 441 places, 434 transitions, 947 flow. Second operand 3 states and 1408 transitions. [2025-01-09 21:33:31,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 435 transitions, 975 flow [2025-01-09 21:33:31,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 435 transitions, 965 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:31,037 INFO L231 Difference]: Finished difference. Result has 437 places, 0 transitions, 0 flow [2025-01-09 21:33:31,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=437, PETRI_TRANSITIONS=0} [2025-01-09 21:33:31,038 INFO L279 CegarLoopForPetriNet]: 464 programPoint places, -27 predicate places. [2025-01-09 21:33:31,038 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 0 transitions, 0 flow [2025-01-09 21:33:31,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 466.6666666666667) internal successors, (1400), 3 states have internal predecessors, (1400), 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:33:31,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2025-01-09 21:33:31,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-01-09 21:33:31,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-01-09 21:33:31,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-01-09 21:33:31,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-01-09 21:33:31,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-01-09 21:33:31,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-01-09 21:33:31,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-01-09 21:33:31,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-01-09 21:33:31,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-01-09 21:33:31,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-01-09 21:33:31,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-01-09 21:33:31,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-01-09 21:33:31,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-01-09 21:33:31,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-01-09 21:33:31,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:33:31,045 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:31,049 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:31,050 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:31,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:31 BasicIcfg [2025-01-09 21:33:31,056 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:31,057 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:31,057 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:31,057 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:31,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:17" (3/4) ... [2025-01-09 21:33:31,058 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:31,061 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:31,061 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:31,061 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:31,066 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-01-09 21:33:31,066 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:31,066 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:31,066 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:31,142 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:31,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:31,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:31,143 INFO L158 Benchmark]: Toolchain (without parser) took 14515.41ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 106.3MB in the beginning and 892.0MB in the end (delta: -785.8MB). Peak memory consumption was 246.7MB. Max. memory is 16.1GB. [2025-01-09 21:33:31,144 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:31,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.58ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 93.2MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:31,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.39ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 89.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:31,145 INFO L158 Benchmark]: Boogie Preprocessor took 48.03ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 87.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:31,145 INFO L158 Benchmark]: RCFGBuilder took 635.90ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 52.6MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:33:31,146 INFO L158 Benchmark]: TraceAbstraction took 13509.03ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 52.6MB in the beginning and 900.4MB in the end (delta: -847.8MB). Peak memory consumption was 800.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:31,146 INFO L158 Benchmark]: Witness Printer took 86.18ms. Allocated memory is still 1.2GB. Free memory was 900.4MB in the beginning and 892.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:31,147 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.68ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.58ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 93.2MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.39ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 89.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.03ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 87.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 635.90ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 52.6MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13509.03ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 52.6MB in the beginning and 900.4MB in the end (delta: -847.8MB). Peak memory consumption was 800.4MB. Max. memory is 16.1GB. * Witness Printer took 86.18ms. Allocated memory is still 1.2GB. Free memory was 900.4MB in the beginning and 892.0MB 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: 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: 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: 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: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 750 locations, 51 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: 13.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1965 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1087 mSDsluCounter, 545 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3354 IncrementalHoareTripleChecker+Invalid, 3944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 180 mSDtfsCounter, 3354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064occurred in iteration=14, InterpolantAutomatonStates: 87, 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.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2206 NumberOfCodeBlocks, 2206 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2187 ConstructedInterpolants, 0 QuantifiedInterpolants, 3302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 9/9 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:31,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE