./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.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-alt.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 cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:13,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:13,592 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:13,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:13,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:13,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:13,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:13,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:13,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:13,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:13,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:13,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:13,611 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:13,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:13,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:13,611 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:13,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:13,612 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:13,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:13,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:13,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:13,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:13,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:13,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:13,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:13,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:13,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:13,613 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:13,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:13,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:13,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:13,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:13,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:13,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:13,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:13,614 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 -> cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 [2025-01-09 21:33:13,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:13,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:13,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:13,803 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:13,803 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:13,804 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-alt.wvr.c [2025-01-09 21:33:14,905 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1cac49de/141e197b03474daeb5c214bb60d96951/FLAG0d2f5b91a [2025-01-09 21:33:15,122 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:15,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-01-09 21:33:15,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1cac49de/141e197b03474daeb5c214bb60d96951/FLAG0d2f5b91a [2025-01-09 21:33:15,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e1cac49de/141e197b03474daeb5c214bb60d96951 [2025-01-09 21:33:15,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:15,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:15,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:15,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:15,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:15,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:15" (1/1) ... [2025-01-09 21:33:15,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50986677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:15, skipping insertion in model container [2025-01-09 21:33:15,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:15" (1/1) ... [2025-01-09 21:33:15,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:15,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:15,732 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:15,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:15,756 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:15,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:15 WrapperNode [2025-01-09 21:33:15,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:15,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:15,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:15,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:15,762 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:15" (1/1) ... [2025-01-09 21:33:15,767 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:15" (1/1) ... [2025-01-09 21:33:15,783 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 248 [2025-01-09 21:33:15,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:15,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:15,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:15,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:15,789 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:15" (1/1) ... [2025-01-09 21:33:15,789 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:15" (1/1) ... [2025-01-09 21:33:15,792 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:15" (1/1) ... [2025-01-09 21:33:15,792 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:15" (1/1) ... [2025-01-09 21:33:15,801 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:15" (1/1) ... [2025-01-09 21:33:15,802 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:15" (1/1) ... [2025-01-09 21:33:15,809 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:15" (1/1) ... [2025-01-09 21:33:15,810 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:15" (1/1) ... [2025-01-09 21:33:15,814 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:15" (1/1) ... [2025-01-09 21:33:15,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:15,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:15,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:15,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:15,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:15" (1/1) ... [2025-01-09 21:33:15,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:15,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:15,849 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:15,851 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:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:15,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:15,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:15,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:15,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:15,871 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:15,943 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:15,944 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:16,279 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:16,279 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:16,299 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:16,299 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:16,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:16 BoogieIcfgContainer [2025-01-09 21:33:16,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:16,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:16,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:16,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:16,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:15" (1/3) ... [2025-01-09 21:33:16,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c09a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:16, skipping insertion in model container [2025-01-09 21:33:16,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:15" (2/3) ... [2025-01-09 21:33:16,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c09a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:16, skipping insertion in model container [2025-01-09 21:33:16,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:16" (3/3) ... [2025-01-09 21:33:16,317 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2025-01-09 21:33:16,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:16,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt.wvr.c that has 4 procedures, 314 locations, 1 initial locations, 4 loop locations, and 21 error locations. [2025-01-09 21:33:16,333 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:16,445 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:16,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 323 places, 331 transitions, 683 flow [2025-01-09 21:33:16,612 INFO L124 PetriNetUnfolderBase]: 18/328 cut-off events. [2025-01-09 21:33:16,616 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:16,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 328 events. 18/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 687 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 249. Up to 2 conditions per place. [2025-01-09 21:33:16,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 323 places, 331 transitions, 683 flow [2025-01-09 21:33:16,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 304 places, 311 transitions, 640 flow [2025-01-09 21:33:16,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:16,652 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;@5b3ad6e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:16,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-01-09 21:33:16,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:16,660 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:33:16,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:16,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:16,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:16,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:16,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1730531520, now seen corresponding path program 1 times [2025-01-09 21:33:16,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:16,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079707269] [2025-01-09 21:33:16,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:16,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:16,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:33:16,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:33:16,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:16,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:16,816 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:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:16,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079707269] [2025-01-09 21:33:16,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079707269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:16,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:16,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:16,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595072422] [2025-01-09 21:33:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:16,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:16,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:16,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:16,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 331 [2025-01-09 21:33:16,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 311 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:16,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:16,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 331 [2025-01-09 21:33:16,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:16,986 INFO L124 PetriNetUnfolderBase]: 19/621 cut-off events. [2025-01-09 21:33:16,987 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-09 21:33:16,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 621 events. 19/621 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2622 event pairs, 7 based on Foata normal form. 33/578 useless extension candidates. Maximal degree in co-relation 471. Up to 31 conditions per place. [2025-01-09 21:33:16,993 INFO L140 encePairwiseOnDemand]: 316/331 looper letters, 13 selfloop transitions, 2 changer transitions 3/298 dead transitions. [2025-01-09 21:33:16,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 298 transitions, 644 flow [2025-01-09 21:33:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-01-09 21:33:17,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345417925478349 [2025-01-09 21:33:17,008 INFO L175 Difference]: Start difference. First operand has 304 places, 311 transitions, 640 flow. Second operand 3 states and 928 transitions. [2025-01-09 21:33:17,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 298 transitions, 644 flow [2025-01-09 21:33:17,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 298 transitions, 632 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:17,025 INFO L231 Difference]: Finished difference. Result has 299 places, 295 transitions, 600 flow [2025-01-09 21:33:17,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=299, PETRI_TRANSITIONS=295} [2025-01-09 21:33:17,037 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -5 predicate places. [2025-01-09 21:33:17,037 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 295 transitions, 600 flow [2025-01-09 21:33:17,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:17,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:17,041 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] [2025-01-09 21:33:17,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:17,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:17,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1600231861, now seen corresponding path program 1 times [2025-01-09 21:33:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:17,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706466855] [2025-01-09 21:33:17,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:17,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:33:17,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:33:17,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:17,102 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:17,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:17,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706466855] [2025-01-09 21:33:17,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706466855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:17,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:17,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755043347] [2025-01-09 21:33:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:17,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:17,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:17,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:17,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 331 [2025-01-09 21:33:17,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 295 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:17,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:17,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 331 [2025-01-09 21:33:17,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:17,212 INFO L124 PetriNetUnfolderBase]: 13/478 cut-off events. [2025-01-09 21:33:17,213 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:33:17,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 478 events. 13/478 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1698 event pairs, 5 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 486. Up to 27 conditions per place. [2025-01-09 21:33:17,216 INFO L140 encePairwiseOnDemand]: 328/331 looper letters, 13 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2025-01-09 21:33:17,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 294 transitions, 628 flow [2025-01-09 21:33:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-01-09 21:33:17,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9224572004028198 [2025-01-09 21:33:17,218 INFO L175 Difference]: Start difference. First operand has 299 places, 295 transitions, 600 flow. Second operand 3 states and 916 transitions. [2025-01-09 21:33:17,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 294 transitions, 628 flow [2025-01-09 21:33:17,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 294 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:17,222 INFO L231 Difference]: Finished difference. Result has 295 places, 294 transitions, 598 flow [2025-01-09 21:33:17,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=295, PETRI_TRANSITIONS=294} [2025-01-09 21:33:17,223 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -9 predicate places. [2025-01-09 21:33:17,223 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 294 transitions, 598 flow [2025-01-09 21:33:17,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:17,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:17,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:17,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:17,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:17,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:17,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1007673563, now seen corresponding path program 1 times [2025-01-09 21:33:17,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:17,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252730351] [2025-01-09 21:33:17,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:17,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:33:17,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:33:17,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:17,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:17,252 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:17,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:17,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252730351] [2025-01-09 21:33:17,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252730351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:17,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:17,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876808973] [2025-01-09 21:33:17,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:17,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:17,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:17,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:17,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:17,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 331 [2025-01-09 21:33:17,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 294 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 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:17,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:17,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 331 [2025-01-09 21:33:17,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:17,427 INFO L124 PetriNetUnfolderBase]: 25/628 cut-off events. [2025-01-09 21:33:17,427 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:33:17,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 628 events. 25/628 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2853 event pairs, 12 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 649. Up to 46 conditions per place. [2025-01-09 21:33:17,432 INFO L140 encePairwiseOnDemand]: 326/331 looper letters, 14 selfloop transitions, 1 changer transitions 0/290 dead transitions. [2025-01-09 21:33:17,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 290 transitions, 620 flow [2025-01-09 21:33:17,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2025-01-09 21:33:17,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.919436052366566 [2025-01-09 21:33:17,439 INFO L175 Difference]: Start difference. First operand has 295 places, 294 transitions, 598 flow. Second operand 3 states and 913 transitions. [2025-01-09 21:33:17,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 290 transitions, 620 flow [2025-01-09 21:33:17,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 290 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:17,443 INFO L231 Difference]: Finished difference. Result has 291 places, 290 transitions, 588 flow [2025-01-09 21:33:17,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=291, PETRI_TRANSITIONS=290} [2025-01-09 21:33:17,444 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -13 predicate places. [2025-01-09 21:33:17,444 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 290 transitions, 588 flow [2025-01-09 21:33:17,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 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:17,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:17,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:17,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:17,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:17,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1493862981, now seen corresponding path program 1 times [2025-01-09 21:33:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:17,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697131998] [2025-01-09 21:33:17,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:17,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:17,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:33:17,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:33:17,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:17,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:17,542 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:17,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:17,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697131998] [2025-01-09 21:33:17,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697131998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:17,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:17,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:17,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909396562] [2025-01-09 21:33:17,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:17,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:17,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:17,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:17,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:17,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 331 [2025-01-09 21:33:17,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 290 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:17,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:17,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 331 [2025-01-09 21:33:17,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:17,687 INFO L124 PetriNetUnfolderBase]: 30/680 cut-off events. [2025-01-09 21:33:17,687 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:33:17,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 680 events. 30/680 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3157 event pairs, 15 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 702. Up to 48 conditions per place. [2025-01-09 21:33:17,692 INFO L140 encePairwiseOnDemand]: 328/331 looper letters, 12 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-01-09 21:33:17,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 289 transitions, 614 flow [2025-01-09 21:33:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2025-01-09 21:33:17,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9244712990936556 [2025-01-09 21:33:17,694 INFO L175 Difference]: Start difference. First operand has 291 places, 290 transitions, 588 flow. Second operand 3 states and 918 transitions. [2025-01-09 21:33:17,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 289 transitions, 614 flow [2025-01-09 21:33:17,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 289 transitions, 613 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:17,697 INFO L231 Difference]: Finished difference. Result has 291 places, 289 transitions, 589 flow [2025-01-09 21:33:17,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=589, PETRI_PLACES=291, PETRI_TRANSITIONS=289} [2025-01-09 21:33:17,698 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -13 predicate places. [2025-01-09 21:33:17,698 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 289 transitions, 589 flow [2025-01-09 21:33:17,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:17,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:17,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:17,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:17,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:17,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 462610902, now seen corresponding path program 1 times [2025-01-09 21:33:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:17,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172091620] [2025-01-09 21:33:17,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:17,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:33:17,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:33:17,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:17,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:18,204 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,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:18,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172091620] [2025-01-09 21:33:18,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172091620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:18,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:18,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740724772] [2025-01-09 21:33:18,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:18,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:18,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:18,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:18,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:18,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 331 [2025-01-09 21:33:18,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 289 transitions, 589 flow. Second operand has 6 states, 6 states have (on average 286.5) internal successors, (1719), 6 states have internal predecessors, (1719), 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,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:18,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 331 [2025-01-09 21:33:18,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:18,767 INFO L124 PetriNetUnfolderBase]: 394/3273 cut-off events. [2025-01-09 21:33:18,768 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-09 21:33:18,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3894 conditions, 3273 events. 394/3273 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 29713 event pairs, 264 based on Foata normal form. 0/2860 useless extension candidates. Maximal degree in co-relation 3857. Up to 580 conditions per place. [2025-01-09 21:33:18,788 INFO L140 encePairwiseOnDemand]: 325/331 looper letters, 26 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-01-09 21:33:18,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 288 transitions, 649 flow [2025-01-09 21:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1742 transitions. [2025-01-09 21:33:18,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.877139979859013 [2025-01-09 21:33:18,793 INFO L175 Difference]: Start difference. First operand has 291 places, 289 transitions, 589 flow. Second operand 6 states and 1742 transitions. [2025-01-09 21:33:18,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 288 transitions, 649 flow [2025-01-09 21:33:18,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 288 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:18,798 INFO L231 Difference]: Finished difference. Result has 293 places, 288 transitions, 593 flow [2025-01-09 21:33:18,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=293, PETRI_TRANSITIONS=288} [2025-01-09 21:33:18,799 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -11 predicate places. [2025-01-09 21:33:18,799 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 288 transitions, 593 flow [2025-01-09 21:33:18,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 286.5) internal successors, (1719), 6 states have internal predecessors, (1719), 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,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:18,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:18,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:18,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1601475651, now seen corresponding path program 1 times [2025-01-09 21:33:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:18,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423652610] [2025-01-09 21:33:18,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:18,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:33:18,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:33:18,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:18,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:18,828 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,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423652610] [2025-01-09 21:33:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423652610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:18,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:18,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354402400] [2025-01-09 21:33:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:18,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:18,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:18,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:18,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 331 [2025-01-09 21:33:18,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 288 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 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,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:18,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 331 [2025-01-09 21:33:18,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:18,903 INFO L124 PetriNetUnfolderBase]: 37/767 cut-off events. [2025-01-09 21:33:18,903 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:33:18,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 767 events. 37/767 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3951 event pairs, 20 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 820. Up to 56 conditions per place. [2025-01-09 21:33:18,909 INFO L140 encePairwiseOnDemand]: 326/331 looper letters, 14 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2025-01-09 21:33:18,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 284 transitions, 615 flow [2025-01-09 21:33:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2025-01-09 21:33:18,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.919436052366566 [2025-01-09 21:33:18,911 INFO L175 Difference]: Start difference. First operand has 293 places, 288 transitions, 593 flow. Second operand 3 states and 913 transitions. [2025-01-09 21:33:18,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 284 transitions, 615 flow [2025-01-09 21:33:18,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 284 transitions, 605 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:18,919 INFO L231 Difference]: Finished difference. Result has 286 places, 284 transitions, 577 flow [2025-01-09 21:33:18,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=286, PETRI_TRANSITIONS=284} [2025-01-09 21:33:18,920 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -18 predicate places. [2025-01-09 21:33:18,920 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 284 transitions, 577 flow [2025-01-09 21:33:18,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 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,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:18,920 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] [2025-01-09 21:33:18,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:18,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:18,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1139274461, now seen corresponding path program 1 times [2025-01-09 21:33:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985865557] [2025-01-09 21:33:18,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:18,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:33:18,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:33:18,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:18,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985865557] [2025-01-09 21:33:18,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985865557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:18,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:18,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167570575] [2025-01-09 21:33:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:18,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:18,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:18,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:18,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 331 [2025-01-09 21:33:18,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 284 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 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,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:18,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 331 [2025-01-09 21:33:18,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:19,011 INFO L124 PetriNetUnfolderBase]: 14/403 cut-off events. [2025-01-09 21:33:19,012 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:33:19,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 403 events. 14/403 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1236 event pairs, 2 based on Foata normal form. 1/374 useless extension candidates. Maximal degree in co-relation 405. Up to 13 conditions per place. [2025-01-09 21:33:19,014 INFO L140 encePairwiseOnDemand]: 326/331 looper letters, 8 selfloop transitions, 2 changer transitions 2/284 dead transitions. [2025-01-09 21:33:19,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 284 transitions, 603 flow [2025-01-09 21:33:19,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-01-09 21:33:19,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.932527693856999 [2025-01-09 21:33:19,016 INFO L175 Difference]: Start difference. First operand has 286 places, 284 transitions, 577 flow. Second operand 3 states and 926 transitions. [2025-01-09 21:33:19,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 284 transitions, 603 flow [2025-01-09 21:33:19,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 284 transitions, 602 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:19,019 INFO L231 Difference]: Finished difference. Result has 285 places, 280 transitions, 571 flow [2025-01-09 21:33:19,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=285, PETRI_TRANSITIONS=280} [2025-01-09 21:33:19,020 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -19 predicate places. [2025-01-09 21:33:19,020 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 280 transitions, 571 flow [2025-01-09 21:33:19,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 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,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:19,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:19,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:19,021 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:19,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash -373878433, now seen corresponding path program 1 times [2025-01-09 21:33:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:19,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077133958] [2025-01-09 21:33:19,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:19,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:19,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:33:19,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:33:19,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:19,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:19,053 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,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:19,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077133958] [2025-01-09 21:33:19,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077133958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:19,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:19,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024921014] [2025-01-09 21:33:19,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:19,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:19,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:19,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:19,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:19,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 331 [2025-01-09 21:33:19,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 280 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:19,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 331 [2025-01-09 21:33:19,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:19,189 INFO L124 PetriNetUnfolderBase]: 113/1677 cut-off events. [2025-01-09 21:33:19,189 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:33:19,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 1677 events. 113/1677 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 12566 event pairs, 22 based on Foata normal form. 0/1529 useless extension candidates. Maximal degree in co-relation 1834. Up to 159 conditions per place. [2025-01-09 21:33:19,197 INFO L140 encePairwiseOnDemand]: 325/331 looper letters, 16 selfloop transitions, 3 changer transitions 0/284 dead transitions. [2025-01-09 21:33:19,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 284 transitions, 621 flow [2025-01-09 21:33:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-01-09 21:33:19,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315206445115811 [2025-01-09 21:33:19,199 INFO L175 Difference]: Start difference. First operand has 285 places, 280 transitions, 571 flow. Second operand 3 states and 925 transitions. [2025-01-09 21:33:19,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 284 transitions, 621 flow [2025-01-09 21:33:19,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 284 transitions, 617 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:19,206 INFO L231 Difference]: Finished difference. Result has 281 places, 280 transitions, 582 flow [2025-01-09 21:33:19,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=281, PETRI_TRANSITIONS=280} [2025-01-09 21:33:19,206 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -23 predicate places. [2025-01-09 21:33:19,206 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 280 transitions, 582 flow [2025-01-09 21:33:19,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:19,207 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] [2025-01-09 21:33:19,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:19,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:19,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash -669489021, now seen corresponding path program 1 times [2025-01-09 21:33:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:19,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016168902] [2025-01-09 21:33:19,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:19,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:33:19,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:33:19,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:19,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:19,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:19,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:19,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016168902] [2025-01-09 21:33:19,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016168902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:19,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:19,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:33:19,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620738979] [2025-01-09 21:33:19,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:19,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:33:19,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:19,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:33:19,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:33:19,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 331 [2025-01-09 21:33:19,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 280 transitions, 582 flow. Second operand has 7 states, 7 states have (on average 297.85714285714283) internal successors, (2085), 7 states have internal predecessors, (2085), 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,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:19,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 331 [2025-01-09 21:33:19,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:19,596 INFO L124 PetriNetUnfolderBase]: 51/994 cut-off events. [2025-01-09 21:33:19,596 INFO L125 PetriNetUnfolderBase]: For 7/21 co-relation queries the response was YES. [2025-01-09 21:33:19,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 994 events. 51/994 cut-off events. For 7/21 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5257 event pairs, 18 based on Foata normal form. 4/930 useless extension candidates. Maximal degree in co-relation 1119. Up to 57 conditions per place. [2025-01-09 21:33:19,602 INFO L140 encePairwiseOnDemand]: 318/331 looper letters, 20 selfloop transitions, 14 changer transitions 0/294 dead transitions. [2025-01-09 21:33:19,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 294 transitions, 685 flow [2025-01-09 21:33:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:33:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:33:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2995 transitions. [2025-01-09 21:33:19,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.904833836858006 [2025-01-09 21:33:19,607 INFO L175 Difference]: Start difference. First operand has 281 places, 280 transitions, 582 flow. Second operand 10 states and 2995 transitions. [2025-01-09 21:33:19,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 294 transitions, 685 flow [2025-01-09 21:33:19,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 294 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:19,611 INFO L231 Difference]: Finished difference. Result has 294 places, 287 transitions, 648 flow [2025-01-09 21:33:19,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=648, PETRI_PLACES=294, PETRI_TRANSITIONS=287} [2025-01-09 21:33:19,613 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -10 predicate places. [2025-01-09 21:33:19,613 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 287 transitions, 648 flow [2025-01-09 21:33:19,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 297.85714285714283) internal successors, (2085), 7 states have internal predecessors, (2085), 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,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:19,614 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] [2025-01-09 21:33:19,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:19,614 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:19,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1023904802, now seen corresponding path program 1 times [2025-01-09 21:33:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:19,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046008004] [2025-01-09 21:33:19,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:19,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:33:19,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:33:19,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:19,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:19,695 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,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:19,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046008004] [2025-01-09 21:33:19,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046008004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:19,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:19,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:19,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743580274] [2025-01-09 21:33:19,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:19,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:33:19,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:19,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:33:19,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:33:19,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 331 [2025-01-09 21:33:19,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 287 transitions, 648 flow. Second operand has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 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,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:19,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 331 [2025-01-09 21:33:19,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:19,875 INFO L124 PetriNetUnfolderBase]: 95/1594 cut-off events. [2025-01-09 21:33:19,875 INFO L125 PetriNetUnfolderBase]: For 57/66 co-relation queries the response was YES. [2025-01-09 21:33:19,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 1594 events. 95/1594 cut-off events. For 57/66 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10865 event pairs, 34 based on Foata normal form. 8/1489 useless extension candidates. Maximal degree in co-relation 1859. Up to 103 conditions per place. [2025-01-09 21:33:19,887 INFO L140 encePairwiseOnDemand]: 325/331 looper letters, 22 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2025-01-09 21:33:19,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 729 flow [2025-01-09 21:33:19,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:33:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:33:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1518 transitions. [2025-01-09 21:33:19,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9172205438066465 [2025-01-09 21:33:19,890 INFO L175 Difference]: Start difference. First operand has 294 places, 287 transitions, 648 flow. Second operand 5 states and 1518 transitions. [2025-01-09 21:33:19,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 729 flow [2025-01-09 21:33:19,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 297 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:19,894 INFO L231 Difference]: Finished difference. Result has 299 places, 289 transitions, 669 flow [2025-01-09 21:33:19,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=669, PETRI_PLACES=299, PETRI_TRANSITIONS=289} [2025-01-09 21:33:19,894 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -5 predicate places. [2025-01-09 21:33:19,894 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 289 transitions, 669 flow [2025-01-09 21:33:19,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 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,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:19,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:19,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1306717643, now seen corresponding path program 1 times [2025-01-09 21:33:19,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:19,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070837546] [2025-01-09 21:33:19,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:19,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:33:19,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:33:19,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:19,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:20,155 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:20,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:20,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070837546] [2025-01-09 21:33:20,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070837546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:20,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:20,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:20,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794147188] [2025-01-09 21:33:20,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:20,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:20,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:20,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:20,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:20,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 331 [2025-01-09 21:33:20,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 289 transitions, 669 flow. Second operand has 6 states, 6 states have (on average 297.6666666666667) internal successors, (1786), 6 states have internal predecessors, (1786), 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:20,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:20,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 331 [2025-01-09 21:33:20,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:20,462 INFO L124 PetriNetUnfolderBase]: 112/1640 cut-off events. [2025-01-09 21:33:20,462 INFO L125 PetriNetUnfolderBase]: For 138/147 co-relation queries the response was YES. [2025-01-09 21:33:20,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 1640 events. 112/1640 cut-off events. For 138/147 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 11122 event pairs, 31 based on Foata normal form. 0/1529 useless extension candidates. Maximal degree in co-relation 2020. Up to 124 conditions per place. [2025-01-09 21:33:20,477 INFO L140 encePairwiseOnDemand]: 325/331 looper letters, 24 selfloop transitions, 5 changer transitions 0/296 dead transitions. [2025-01-09 21:33:20,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 296 transitions, 749 flow [2025-01-09 21:33:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1804 transitions. [2025-01-09 21:33:20,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9083585095669687 [2025-01-09 21:33:20,480 INFO L175 Difference]: Start difference. First operand has 299 places, 289 transitions, 669 flow. Second operand 6 states and 1804 transitions. [2025-01-09 21:33:20,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 296 transitions, 749 flow [2025-01-09 21:33:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 296 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:20,516 INFO L231 Difference]: Finished difference. Result has 301 places, 288 transitions, 672 flow [2025-01-09 21:33:20,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=672, PETRI_PLACES=301, PETRI_TRANSITIONS=288} [2025-01-09 21:33:20,517 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -3 predicate places. [2025-01-09 21:33:20,517 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 288 transitions, 672 flow [2025-01-09 21:33:20,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.6666666666667) internal successors, (1786), 6 states have internal predecessors, (1786), 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:20,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:20,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:20,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:20,519 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:20,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1391558305, now seen corresponding path program 1 times [2025-01-09 21:33:20,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:20,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205768260] [2025-01-09 21:33:20,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:20,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:20,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:33:20,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:33:20,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:20,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:20,848 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:20,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:20,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205768260] [2025-01-09 21:33:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205768260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:20,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:20,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:20,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121239947] [2025-01-09 21:33:20,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:20,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:20,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:20,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:20,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:20,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 331 [2025-01-09 21:33:20,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 288 transitions, 672 flow. Second operand has 6 states, 6 states have (on average 297.8333333333333) internal successors, (1787), 6 states have internal predecessors, (1787), 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:20,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:20,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 331 [2025-01-09 21:33:20,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:21,144 INFO L124 PetriNetUnfolderBase]: 182/1653 cut-off events. [2025-01-09 21:33:21,144 INFO L125 PetriNetUnfolderBase]: For 135/226 co-relation queries the response was YES. [2025-01-09 21:33:21,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 1653 events. 182/1653 cut-off events. For 135/226 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11876 event pairs, 44 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 2091. Up to 173 conditions per place. [2025-01-09 21:33:21,151 INFO L140 encePairwiseOnDemand]: 325/331 looper letters, 22 selfloop transitions, 5 changer transitions 6/295 dead transitions. [2025-01-09 21:33:21,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 295 transitions, 748 flow [2025-01-09 21:33:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1804 transitions. [2025-01-09 21:33:21,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9083585095669687 [2025-01-09 21:33:21,154 INFO L175 Difference]: Start difference. First operand has 301 places, 288 transitions, 672 flow. Second operand 6 states and 1804 transitions. [2025-01-09 21:33:21,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 295 transitions, 748 flow [2025-01-09 21:33:21,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 295 transitions, 738 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:21,158 INFO L231 Difference]: Finished difference. Result has 300 places, 281 transitions, 638 flow [2025-01-09 21:33:21,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=638, PETRI_PLACES=300, PETRI_TRANSITIONS=281} [2025-01-09 21:33:21,158 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -4 predicate places. [2025-01-09 21:33:21,158 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 281 transitions, 638 flow [2025-01-09 21:33:21,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.8333333333333) internal successors, (1787), 6 states have internal predecessors, (1787), 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,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:21,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:21,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:21,160 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:21,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash -195055784, now seen corresponding path program 1 times [2025-01-09 21:33:21,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:21,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233655733] [2025-01-09 21:33:21,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:21,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:33:21,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:33:21,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:21,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:33:21,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233655733] [2025-01-09 21:33:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233655733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:21,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:21,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103499366] [2025-01-09 21:33:21,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:21,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:21,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:21,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:21,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:21,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 331 [2025-01-09 21:33:21,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 281 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 298.1666666666667) internal successors, (1789), 6 states have internal predecessors, (1789), 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,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:21,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 331 [2025-01-09 21:33:21,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:21,648 INFO L124 PetriNetUnfolderBase]: 68/1078 cut-off events. [2025-01-09 21:33:21,649 INFO L125 PetriNetUnfolderBase]: For 26/32 co-relation queries the response was YES. [2025-01-09 21:33:21,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 1078 events. 68/1078 cut-off events. For 26/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6404 event pairs, 17 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 1339. Up to 67 conditions per place. [2025-01-09 21:33:21,655 INFO L140 encePairwiseOnDemand]: 325/331 looper letters, 22 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-01-09 21:33:21,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 288 transitions, 714 flow [2025-01-09 21:33:21,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1804 transitions. [2025-01-09 21:33:21,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9083585095669687 [2025-01-09 21:33:21,658 INFO L175 Difference]: Start difference. First operand has 300 places, 281 transitions, 638 flow. Second operand 6 states and 1804 transitions. [2025-01-09 21:33:21,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 288 transitions, 714 flow [2025-01-09 21:33:21,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 684 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-01-09 21:33:21,662 INFO L231 Difference]: Finished difference. Result has 289 places, 280 transitions, 616 flow [2025-01-09 21:33:21,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=616, PETRI_PLACES=289, PETRI_TRANSITIONS=280} [2025-01-09 21:33:21,663 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -15 predicate places. [2025-01-09 21:33:21,663 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 280 transitions, 616 flow [2025-01-09 21:33:21,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.1666666666667) internal successors, (1789), 6 states have internal predecessors, (1789), 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,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:21,664 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:21,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:21,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:33:21,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash -104062319, now seen corresponding path program 1 times [2025-01-09 21:33:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:21,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165026973] [2025-01-09 21:33:21,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:21,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 21:33:21,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 21:33:21,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:21,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:33:21,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:21,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165026973] [2025-01-09 21:33:21,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165026973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:21,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:21,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:21,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396566518] [2025-01-09 21:33:21,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:21,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:21,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:21,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:21,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:21,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 331 [2025-01-09 21:33:21,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 280 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 305.6666666666667) internal successors, (917), 3 states have internal predecessors, (917), 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,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:21,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 331 [2025-01-09 21:33:21,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:21,786 INFO L124 PetriNetUnfolderBase]: 56/1029 cut-off events. [2025-01-09 21:33:21,786 INFO L125 PetriNetUnfolderBase]: For 8/18 co-relation queries the response was YES. [2025-01-09 21:33:21,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 1029 events. 56/1029 cut-off events. For 8/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6017 event pairs, 17 based on Foata normal form. 1/977 useless extension candidates. Maximal degree in co-relation 1207. Up to 58 conditions per place. [2025-01-09 21:33:21,791 INFO L140 encePairwiseOnDemand]: 328/331 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2025-01-09 21:33:21,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 281 transitions, 644 flow [2025-01-09 21:33:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-01-09 21:33:21,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315206445115811 [2025-01-09 21:33:21,793 INFO L175 Difference]: Start difference. First operand has 289 places, 280 transitions, 616 flow. Second operand 3 states and 925 transitions. [2025-01-09 21:33:21,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 281 transitions, 644 flow [2025-01-09 21:33:21,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 281 transitions, 634 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:21,795 INFO L231 Difference]: Finished difference. Result has 285 places, 0 transitions, 0 flow [2025-01-09 21:33:21,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=285, PETRI_TRANSITIONS=0} [2025-01-09 21:33:21,796 INFO L279 CegarLoopForPetriNet]: 304 programPoint places, -19 predicate places. [2025-01-09 21:33:21,796 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 0 transitions, 0 flow [2025-01-09 21:33:21,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.6666666666667) internal successors, (917), 3 states have internal predecessors, (917), 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,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (35 of 36 remaining) [2025-01-09 21:33:21,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-01-09 21:33:21,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-01-09 21:33:21,800 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-01-09 21:33:21,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-01-09 21:33:21,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-01-09 21:33:21,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-01-09 21:33:21,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-01-09 21:33:21,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:21,801 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:21,804 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:21,804 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:21,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:21 BasicIcfg [2025-01-09 21:33:21,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:21,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:21,808 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:21,808 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:21,809 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:16" (3/4) ... [2025-01-09 21:33:21,809 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:21,811 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:21,811 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:21,811 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:21,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-09 21:33:21,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:21,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:21,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:21,867 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:21,867 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:21,867 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:21,868 INFO L158 Benchmark]: Toolchain (without parser) took 6377.36ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 107.1MB in the beginning and 174.1MB in the end (delta: -67.0MB). Peak memory consumption was 162.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:21,868 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:21,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.74ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 94.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:21,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.32ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:21,868 INFO L158 Benchmark]: Boogie Preprocessor took 31.58ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:21,869 INFO L158 Benchmark]: RCFGBuilder took 483.36ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 65.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:21,869 INFO L158 Benchmark]: TraceAbstraction took 5506.04ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 64.8MB in the beginning and 178.3MB in the end (delta: -113.5MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2025-01-09 21:33:21,869 INFO L158 Benchmark]: Witness Printer took 59.28ms. Allocated memory is still 377.5MB. Free memory was 178.3MB in the beginning and 174.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:21,870 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.19ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.74ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 94.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.32ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.58ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 483.36ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 65.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5506.04ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 64.8MB in the beginning and 178.3MB in the end (delta: -113.5MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. * Witness Printer took 59.28ms. Allocated memory is still 377.5MB. Free memory was 178.3MB in the beginning and 174.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 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: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: 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, 484 locations, 36 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: 5.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 905 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 504 mSDsluCounter, 373 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 279 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1322 IncrementalHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 94 mSDtfsCounter, 1322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=672occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1106 ConstructedInterpolants, 0 QuantifiedInterpolants, 1804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 8/8 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:21,883 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