./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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/goblint-regression/09-regions_01-list_rc.i -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 3468cfea1e2552ee69c1236196f7193e72e290c81920516b4f57e05ea8ee84cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:31:26,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:31:27,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:31:27,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:31:27,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:31:27,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:31:27,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:31:27,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:31:27,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:31:27,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:31:27,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:31:27,026 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:31:27,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:31:27,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:31:27,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:31:27,027 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 -> 3468cfea1e2552ee69c1236196f7193e72e290c81920516b4f57e05ea8ee84cc [2025-02-08 05:31:27,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:31:27,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:31:27,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:31:27,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:31:27,289 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:31:27,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i [2025-02-08 05:31:28,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27f3ae6c9/e2bcfd8bed1f430891dda6f7073c31c1/FLAG5b3b0328a [2025-02-08 05:31:28,877 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:31:28,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_01-list_rc.i [2025-02-08 05:31:28,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27f3ae6c9/e2bcfd8bed1f430891dda6f7073c31c1/FLAG5b3b0328a [2025-02-08 05:31:29,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27f3ae6c9/e2bcfd8bed1f430891dda6f7073c31c1 [2025-02-08 05:31:29,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:31:29,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:31:29,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:31:29,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:31:29,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:31:29,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f944bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29, skipping insertion in model container [2025-02-08 05:31:29,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:31:29,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:31:29,581 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:31:29,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:31:29,676 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:31:29,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29 WrapperNode [2025-02-08 05:31:29,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:31:29,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:31:29,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:31:29,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:31:29,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,736 INFO L138 Inliner]: procedures = 368, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2025-02-08 05:31:29,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:31:29,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:31:29,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:31:29,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:31:29,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,772 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:31:29,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:31:29,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:31:29,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:31:29,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (1/1) ... [2025-02-08 05:31:29,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:31:29,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:29,821 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-02-08 05:31:29,827 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-02-08 05:31:29,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:31:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:31:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:31:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:31:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:31:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:31:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:31:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:31:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:31:29,846 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:31:29,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:31:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:31:29,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:31:29,848 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:31:29,960 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:31:29,961 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:31:30,239 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:31:30,240 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:31:30,255 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:31:30,255 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:31:30,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:31:30 BoogieIcfgContainer [2025-02-08 05:31:30,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:31:30,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:31:30,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:31:30,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:31:30,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:31:29" (1/3) ... [2025-02-08 05:31:30,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4868279f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:31:30, skipping insertion in model container [2025-02-08 05:31:30,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:29" (2/3) ... [2025-02-08 05:31:30,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4868279f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:31:30, skipping insertion in model container [2025-02-08 05:31:30,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:31:30" (3/3) ... [2025-02-08 05:31:30,262 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_01-list_rc.i [2025-02-08 05:31:30,272 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:31:30,273 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_01-list_rc.i that has 2 procedures, 200 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-02-08 05:31:30,273 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:31:30,354 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:31:30,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 199 transitions, 402 flow [2025-02-08 05:31:30,434 INFO L124 PetriNetUnfolderBase]: 0/198 cut-off events. [2025-02-08 05:31:30,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:30,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 198 events. 0/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 103 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-02-08 05:31:30,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 199 transitions, 402 flow [2025-02-08 05:31:30,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 198 transitions, 399 flow [2025-02-08 05:31:30,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:31:30,460 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;@2be8e50c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:31:30,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-08 05:31:30,470 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:31:30,473 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-08 05:31:30,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:30,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:30,474 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-02-08 05:31:30,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:30,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2129611178, now seen corresponding path program 1 times [2025-02-08 05:31:30,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:30,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706472541] [2025-02-08 05:31:30,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:30,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:30,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:31:30,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:31:30,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:30,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:31,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:31,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706472541] [2025-02-08 05:31:31,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706472541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:31,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:31,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:31,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309618837] [2025-02-08 05:31:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:31,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:31,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:31,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:31,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 199 [2025-02-08 05:31:31,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 198 transitions, 399 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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-02-08 05:31:31,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:31,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 199 [2025-02-08 05:31:31,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:31,608 INFO L124 PetriNetUnfolderBase]: 220/1022 cut-off events. [2025-02-08 05:31:31,608 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:31,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 1022 events. 220/1022 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5399 event pairs, 220 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1398. Up to 488 conditions per place. [2025-02-08 05:31:31,615 INFO L140 encePairwiseOnDemand]: 187/199 looper letters, 47 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2025-02-08 05:31:31,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 196 transitions, 509 flow [2025-02-08 05:31:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 899 transitions. [2025-02-08 05:31:31,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7529313232830821 [2025-02-08 05:31:31,626 INFO L175 Difference]: Start difference. First operand has 202 places, 198 transitions, 399 flow. Second operand 6 states and 899 transitions. [2025-02-08 05:31:31,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 196 transitions, 509 flow [2025-02-08 05:31:31,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 196 transitions, 508 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:31,632 INFO L231 Difference]: Finished difference. Result has 204 places, 196 transitions, 414 flow [2025-02-08 05:31:31,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=204, PETRI_TRANSITIONS=196} [2025-02-08 05:31:31,636 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 2 predicate places. [2025-02-08 05:31:31,636 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 196 transitions, 414 flow [2025-02-08 05:31:31,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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-02-08 05:31:31,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:31,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:31,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:31:31,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:31,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1711824621, now seen corresponding path program 1 times [2025-02-08 05:31:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:31,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895752683] [2025-02-08 05:31:31,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:31,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:31:31,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:31:31,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:31,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:31,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:31,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895752683] [2025-02-08 05:31:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895752683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:31,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:31,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:31,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135316771] [2025-02-08 05:31:31,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:31,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:31,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:31,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:32,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 199 [2025-02-08 05:31:32,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 196 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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-02-08 05:31:32,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:32,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 199 [2025-02-08 05:31:32,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:32,325 INFO L124 PetriNetUnfolderBase]: 220/1020 cut-off events. [2025-02-08 05:31:32,326 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:32,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 1020 events. 220/1020 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5388 event pairs, 220 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1439. Up to 488 conditions per place. [2025-02-08 05:31:32,354 INFO L140 encePairwiseOnDemand]: 187/199 looper letters, 47 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2025-02-08 05:31:32,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 194 transitions, 524 flow [2025-02-08 05:31:32,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:32,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 899 transitions. [2025-02-08 05:31:32,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7529313232830821 [2025-02-08 05:31:32,358 INFO L175 Difference]: Start difference. First operand has 204 places, 196 transitions, 414 flow. Second operand 6 states and 899 transitions. [2025-02-08 05:31:32,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 194 transitions, 524 flow [2025-02-08 05:31:32,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 194 transitions, 504 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:31:32,364 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 410 flow [2025-02-08 05:31:32,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=202, PETRI_TRANSITIONS=194} [2025-02-08 05:31:32,365 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 0 predicate places. [2025-02-08 05:31:32,365 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 410 flow [2025-02-08 05:31:32,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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-02-08 05:31:32,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:32,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:32,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:31:32,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:32,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1971415017, now seen corresponding path program 1 times [2025-02-08 05:31:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:32,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338952332] [2025-02-08 05:31:32,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:32,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:32,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:31:32,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:31:32,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:32,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:32,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:32,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338952332] [2025-02-08 05:31:32,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338952332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:32,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:32,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:31:32,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313479846] [2025-02-08 05:31:32,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:32,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:31:32,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:32,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:31:32,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:31:32,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 199 [2025-02-08 05:31:32,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 194 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-02-08 05:31:32,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:32,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 199 [2025-02-08 05:31:32,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:32,487 INFO L124 PetriNetUnfolderBase]: 16/329 cut-off events. [2025-02-08 05:31:32,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:32,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 329 events. 16/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 779 event pairs, 16 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 298. Up to 47 conditions per place. [2025-02-08 05:31:32,488 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 14 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-02-08 05:31:32,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 193 transitions, 440 flow [2025-02-08 05:31:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:31:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:31:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2025-02-08 05:31:32,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430485762144054 [2025-02-08 05:31:32,493 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 410 flow. Second operand 3 states and 563 transitions. [2025-02-08 05:31:32,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 193 transitions, 440 flow [2025-02-08 05:31:32,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 193 transitions, 420 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:31:32,496 INFO L231 Difference]: Finished difference. Result has 198 places, 193 transitions, 392 flow [2025-02-08 05:31:32,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=198, PETRI_TRANSITIONS=193} [2025-02-08 05:31:32,497 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -4 predicate places. [2025-02-08 05:31:32,497 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 193 transitions, 392 flow [2025-02-08 05:31:32,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 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-02-08 05:31:32,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:32,499 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] [2025-02-08 05:31:32,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:31:32,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:32,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2052951813, now seen corresponding path program 1 times [2025-02-08 05:31:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:32,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345881869] [2025-02-08 05:31:32,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:32,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:31:32,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:31:32,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:32,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:32,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-02-08 05:31:32,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:32,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345881869] [2025-02-08 05:31:32,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345881869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:32,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:32,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:31:32,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133680631] [2025-02-08 05:31:32,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:32,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:31:32,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:32,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:31:32,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:31:32,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 199 [2025-02-08 05:31:32,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 193 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-02-08 05:31:32,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:32,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 199 [2025-02-08 05:31:32,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:32,608 INFO L124 PetriNetUnfolderBase]: 24/406 cut-off events. [2025-02-08 05:31:32,609 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:32,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 406 events. 24/406 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1223 event pairs, 24 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 419. Up to 63 conditions per place. [2025-02-08 05:31:32,610 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 15 selfloop transitions, 1 changer transitions 0/188 dead transitions. [2025-02-08 05:31:32,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 188 transitions, 414 flow [2025-02-08 05:31:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:31:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:31:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-02-08 05:31:32,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9296482412060302 [2025-02-08 05:31:32,612 INFO L175 Difference]: Start difference. First operand has 198 places, 193 transitions, 392 flow. Second operand 3 states and 555 transitions. [2025-02-08 05:31:32,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 188 transitions, 414 flow [2025-02-08 05:31:32,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 188 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:31:32,614 INFO L231 Difference]: Finished difference. Result has 193 places, 188 transitions, 380 flow [2025-02-08 05:31:32,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=193, PETRI_TRANSITIONS=188} [2025-02-08 05:31:32,615 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -9 predicate places. [2025-02-08 05:31:32,615 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 188 transitions, 380 flow [2025-02-08 05:31:32,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-02-08 05:31:32,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:32,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:32,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:31:32,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:32,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:32,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1836846889, now seen corresponding path program 1 times [2025-02-08 05:31:32,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:32,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291707606] [2025-02-08 05:31:32,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:32,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:32,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:31:32,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:31:32,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:32,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:33,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:33,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291707606] [2025-02-08 05:31:33,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291707606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:33,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:33,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:33,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65751619] [2025-02-08 05:31:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:33,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:33,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:33,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:33,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:33,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 199 [2025-02-08 05:31:33,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 188 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 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-02-08 05:31:33,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:33,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 199 [2025-02-08 05:31:33,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:33,386 INFO L124 PetriNetUnfolderBase]: 288/1159 cut-off events. [2025-02-08 05:31:33,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:33,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 1159 events. 288/1159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6262 event pairs, 288 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1736. Up to 635 conditions per place. [2025-02-08 05:31:33,391 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 58 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2025-02-08 05:31:33,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 187 transitions, 504 flow [2025-02-08 05:31:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-02-08 05:31:33,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7319932998324958 [2025-02-08 05:31:33,393 INFO L175 Difference]: Start difference. First operand has 193 places, 188 transitions, 380 flow. Second operand 6 states and 874 transitions. [2025-02-08 05:31:33,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 187 transitions, 504 flow [2025-02-08 05:31:33,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 187 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:33,398 INFO L231 Difference]: Finished difference. Result has 196 places, 187 transitions, 387 flow [2025-02-08 05:31:33,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=196, PETRI_TRANSITIONS=187} [2025-02-08 05:31:33,400 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -6 predicate places. [2025-02-08 05:31:33,401 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 187 transitions, 387 flow [2025-02-08 05:31:33,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 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-02-08 05:31:33,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:33,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:33,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:31:33,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:33,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash -453657366, now seen corresponding path program 1 times [2025-02-08 05:31:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:33,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81195598] [2025-02-08 05:31:33,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:33,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:31:33,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:31:33,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:33,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:33,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81195598] [2025-02-08 05:31:33,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81195598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:33,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:33,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316678367] [2025-02-08 05:31:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:33,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:33,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:33,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:34,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 199 [2025-02-08 05:31:34,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 187 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 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-02-08 05:31:34,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:34,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 199 [2025-02-08 05:31:34,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:34,337 INFO L124 PetriNetUnfolderBase]: 316/1485 cut-off events. [2025-02-08 05:31:34,338 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:34,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 1485 events. 316/1485 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9187 event pairs, 36 based on Foata normal form. 0/1395 useless extension candidates. Maximal degree in co-relation 2154. Up to 380 conditions per place. [2025-02-08 05:31:34,343 INFO L140 encePairwiseOnDemand]: 171/199 looper letters, 99 selfloop transitions, 70 changer transitions 0/299 dead transitions. [2025-02-08 05:31:34,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 299 transitions, 949 flow [2025-02-08 05:31:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1023 transitions. [2025-02-08 05:31:34,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8567839195979899 [2025-02-08 05:31:34,345 INFO L175 Difference]: Start difference. First operand has 196 places, 187 transitions, 387 flow. Second operand 6 states and 1023 transitions. [2025-02-08 05:31:34,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 299 transitions, 949 flow [2025-02-08 05:31:34,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 299 transitions, 939 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:31:34,351 INFO L231 Difference]: Finished difference. Result has 200 places, 257 transitions, 855 flow [2025-02-08 05:31:34,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=855, PETRI_PLACES=200, PETRI_TRANSITIONS=257} [2025-02-08 05:31:34,352 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -2 predicate places. [2025-02-08 05:31:34,352 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 257 transitions, 855 flow [2025-02-08 05:31:34,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 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-02-08 05:31:34,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:34,353 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] [2025-02-08 05:31:34,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:31:34,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:34,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:34,354 INFO L85 PathProgramCache]: Analyzing trace with hash -372222593, now seen corresponding path program 1 times [2025-02-08 05:31:34,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:34,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111444167] [2025-02-08 05:31:34,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:34,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:34,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:31:34,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:31:34,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:34,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:34,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:34,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111444167] [2025-02-08 05:31:34,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111444167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:34,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:34,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917116401] [2025-02-08 05:31:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:34,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:34,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:34,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:34,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:34,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 199 [2025-02-08 05:31:34,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 257 transitions, 855 flow. Second operand has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 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-02-08 05:31:34,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:34,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 199 [2025-02-08 05:31:34,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:35,250 INFO L124 PetriNetUnfolderBase]: 588/2256 cut-off events. [2025-02-08 05:31:35,250 INFO L125 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2025-02-08 05:31:35,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4645 conditions, 2256 events. 588/2256 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15131 event pairs, 222 based on Foata normal form. 0/2145 useless extension candidates. Maximal degree in co-relation 4576. Up to 1082 conditions per place. [2025-02-08 05:31:35,260 INFO L140 encePairwiseOnDemand]: 184/199 looper letters, 106 selfloop transitions, 48 changer transitions 0/308 dead transitions. [2025-02-08 05:31:35,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 308 transitions, 1335 flow [2025-02-08 05:31:35,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 960 transitions. [2025-02-08 05:31:35,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8040201005025126 [2025-02-08 05:31:35,263 INFO L175 Difference]: Start difference. First operand has 200 places, 257 transitions, 855 flow. Second operand 6 states and 960 transitions. [2025-02-08 05:31:35,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 308 transitions, 1335 flow [2025-02-08 05:31:35,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 308 transitions, 1335 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:35,270 INFO L231 Difference]: Finished difference. Result has 210 places, 300 transitions, 1243 flow [2025-02-08 05:31:35,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1243, PETRI_PLACES=210, PETRI_TRANSITIONS=300} [2025-02-08 05:31:35,271 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 8 predicate places. [2025-02-08 05:31:35,271 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 300 transitions, 1243 flow [2025-02-08 05:31:35,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 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-02-08 05:31:35,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:35,272 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-02-08 05:31:35,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:31:35,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:35,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -247223521, now seen corresponding path program 1 times [2025-02-08 05:31:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:35,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891998932] [2025-02-08 05:31:35,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:35,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:31:35,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:31:35,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:35,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:35,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:35,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891998932] [2025-02-08 05:31:35,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891998932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:35,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:35,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:35,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425286271] [2025-02-08 05:31:35,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:35,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:35,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:35,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:35,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:35,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 199 [2025-02-08 05:31:35,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 300 transitions, 1243 flow. Second operand has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 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-02-08 05:31:35,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:35,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 199 [2025-02-08 05:31:35,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:36,182 INFO L124 PetriNetUnfolderBase]: 752/2809 cut-off events. [2025-02-08 05:31:36,182 INFO L125 PetriNetUnfolderBase]: For 1636/1693 co-relation queries the response was YES. [2025-02-08 05:31:36,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2809 events. 752/2809 cut-off events. For 1636/1693 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 20051 event pairs, 86 based on Foata normal form. 0/2713 useless extension candidates. Maximal degree in co-relation 6514. Up to 1022 conditions per place. [2025-02-08 05:31:36,194 INFO L140 encePairwiseOnDemand]: 176/199 looper letters, 128 selfloop transitions, 136 changer transitions 4/440 dead transitions. [2025-02-08 05:31:36,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 440 transitions, 2535 flow [2025-02-08 05:31:36,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1018 transitions. [2025-02-08 05:31:36,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8525963149078727 [2025-02-08 05:31:36,197 INFO L175 Difference]: Start difference. First operand has 210 places, 300 transitions, 1243 flow. Second operand 6 states and 1018 transitions. [2025-02-08 05:31:36,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 440 transitions, 2535 flow [2025-02-08 05:31:36,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 440 transitions, 2517 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:36,208 INFO L231 Difference]: Finished difference. Result has 220 places, 431 transitions, 2591 flow [2025-02-08 05:31:36,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2591, PETRI_PLACES=220, PETRI_TRANSITIONS=431} [2025-02-08 05:31:36,209 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 18 predicate places. [2025-02-08 05:31:36,209 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 431 transitions, 2591 flow [2025-02-08 05:31:36,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 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-02-08 05:31:36,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:36,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:36,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:31:36,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:36,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:36,210 INFO L85 PathProgramCache]: Analyzing trace with hash -415816540, now seen corresponding path program 1 times [2025-02-08 05:31:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690188642] [2025-02-08 05:31:36,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:36,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:31:36,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:31:36,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:36,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:36,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:36,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690188642] [2025-02-08 05:31:36,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690188642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:36,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:36,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 05:31:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127021537] [2025-02-08 05:31:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:36,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:31:36,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:36,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:31:36,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:31:37,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-02-08 05:31:37,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 431 transitions, 2591 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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-02-08 05:31:37,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:37,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-02-08 05:31:37,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:38,729 INFO L124 PetriNetUnfolderBase]: 1151/4146 cut-off events. [2025-02-08 05:31:38,729 INFO L125 PetriNetUnfolderBase]: For 5344/5448 co-relation queries the response was YES. [2025-02-08 05:31:38,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11912 conditions, 4146 events. 1151/4146 cut-off events. For 5344/5448 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 33191 event pairs, 94 based on Foata normal form. 35/4083 useless extension candidates. Maximal degree in co-relation 11828. Up to 880 conditions per place. [2025-02-08 05:31:38,748 INFO L140 encePairwiseOnDemand]: 162/199 looper letters, 349 selfloop transitions, 159 changer transitions 4/655 dead transitions. [2025-02-08 05:31:38,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 655 transitions, 5031 flow [2025-02-08 05:31:38,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 05:31:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 05:31:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2077 transitions. [2025-02-08 05:31:38,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7455132806891601 [2025-02-08 05:31:38,752 INFO L175 Difference]: Start difference. First operand has 220 places, 431 transitions, 2591 flow. Second operand 14 states and 2077 transitions. [2025-02-08 05:31:38,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 655 transitions, 5031 flow [2025-02-08 05:31:38,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 655 transitions, 4959 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:38,774 INFO L231 Difference]: Finished difference. Result has 243 places, 494 transitions, 3864 flow [2025-02-08 05:31:38,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3864, PETRI_PLACES=243, PETRI_TRANSITIONS=494} [2025-02-08 05:31:38,777 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 41 predicate places. [2025-02-08 05:31:38,777 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 494 transitions, 3864 flow [2025-02-08 05:31:38,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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-02-08 05:31:38,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:38,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:38,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:31:38,779 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:38,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1381998610, now seen corresponding path program 2 times [2025-02-08 05:31:38,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112408663] [2025-02-08 05:31:38,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:38,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:31:38,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:31:38,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:38,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112408663] [2025-02-08 05:31:39,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112408663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:39,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:39,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 05:31:39,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975500877] [2025-02-08 05:31:39,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:39,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:31:39,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:39,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:31:39,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:31:40,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-02-08 05:31:40,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 494 transitions, 3864 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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-02-08 05:31:40,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:40,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-02-08 05:31:40,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:41,218 INFO L124 PetriNetUnfolderBase]: 1262/4509 cut-off events. [2025-02-08 05:31:41,219 INFO L125 PetriNetUnfolderBase]: For 9542/9645 co-relation queries the response was YES. [2025-02-08 05:31:41,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14412 conditions, 4509 events. 1262/4509 cut-off events. For 9542/9645 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 36335 event pairs, 93 based on Foata normal form. 39/4426 useless extension candidates. Maximal degree in co-relation 14314. Up to 891 conditions per place. [2025-02-08 05:31:41,247 INFO L140 encePairwiseOnDemand]: 178/199 looper letters, 440 selfloop transitions, 103 changer transitions 0/686 dead transitions. [2025-02-08 05:31:41,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 686 transitions, 6408 flow [2025-02-08 05:31:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 05:31:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 05:31:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2654 transitions. [2025-02-08 05:31:41,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.701930706162391 [2025-02-08 05:31:41,253 INFO L175 Difference]: Start difference. First operand has 243 places, 494 transitions, 3864 flow. Second operand 19 states and 2654 transitions. [2025-02-08 05:31:41,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 686 transitions, 6408 flow [2025-02-08 05:31:41,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 686 transitions, 6403 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:31:41,288 INFO L231 Difference]: Finished difference. Result has 267 places, 549 transitions, 4679 flow [2025-02-08 05:31:41,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=3859, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4679, PETRI_PLACES=267, PETRI_TRANSITIONS=549} [2025-02-08 05:31:41,289 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 65 predicate places. [2025-02-08 05:31:41,289 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 549 transitions, 4679 flow [2025-02-08 05:31:41,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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-02-08 05:31:41,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:41,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:41,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:31:41,290 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:41,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:41,291 INFO L85 PathProgramCache]: Analyzing trace with hash -814160378, now seen corresponding path program 3 times [2025-02-08 05:31:41,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:41,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232181439] [2025-02-08 05:31:41,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:31:41,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:41,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:31:41,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:31:41,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:31:41,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:41,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:41,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232181439] [2025-02-08 05:31:41,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232181439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:41,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:41,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 05:31:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037064557] [2025-02-08 05:31:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:41,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:31:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:41,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:31:41,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:31:42,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-02-08 05:31:42,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 549 transitions, 4679 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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-02-08 05:31:42,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:42,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-02-08 05:31:42,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:43,829 INFO L124 PetriNetUnfolderBase]: 1756/6366 cut-off events. [2025-02-08 05:31:43,830 INFO L125 PetriNetUnfolderBase]: For 18326/18539 co-relation queries the response was YES. [2025-02-08 05:31:43,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21526 conditions, 6366 events. 1756/6366 cut-off events. For 18326/18539 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 58102 event pairs, 163 based on Foata normal form. 53/6261 useless extension candidates. Maximal degree in co-relation 21418. Up to 1877 conditions per place. [2025-02-08 05:31:43,860 INFO L140 encePairwiseOnDemand]: 166/199 looper letters, 417 selfloop transitions, 204 changer transitions 1/765 dead transitions. [2025-02-08 05:31:43,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 765 transitions, 8082 flow [2025-02-08 05:31:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 05:31:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 05:31:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2111 transitions. [2025-02-08 05:31:43,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7072026800670017 [2025-02-08 05:31:43,865 INFO L175 Difference]: Start difference. First operand has 267 places, 549 transitions, 4679 flow. Second operand 15 states and 2111 transitions. [2025-02-08 05:31:43,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 765 transitions, 8082 flow [2025-02-08 05:31:43,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 765 transitions, 8041 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 05:31:43,910 INFO L231 Difference]: Finished difference. Result has 286 places, 653 transitions, 6958 flow [2025-02-08 05:31:43,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=4653, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6958, PETRI_PLACES=286, PETRI_TRANSITIONS=653} [2025-02-08 05:31:43,911 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 84 predicate places. [2025-02-08 05:31:43,911 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 653 transitions, 6958 flow [2025-02-08 05:31:43,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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-02-08 05:31:43,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:43,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:43,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:31:43,912 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:43,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:43,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1068634156, now seen corresponding path program 4 times [2025-02-08 05:31:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:43,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646542722] [2025-02-08 05:31:43,913 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:31:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:43,926 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 114 statements into 2 equivalence classes. [2025-02-08 05:31:43,932 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 108 of 114 statements. [2025-02-08 05:31:43,933 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:31:43,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:44,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:44,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646542722] [2025-02-08 05:31:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646542722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:44,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 05:31:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727449157] [2025-02-08 05:31:44,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:44,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:31:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:44,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:31:44,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:31:45,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 199 [2025-02-08 05:31:45,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 653 transitions, 6958 flow. Second operand has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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-02-08 05:31:45,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:45,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 199 [2025-02-08 05:31:45,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:47,298 INFO L124 PetriNetUnfolderBase]: 2409/8668 cut-off events. [2025-02-08 05:31:47,298 INFO L125 PetriNetUnfolderBase]: For 36196/36481 co-relation queries the response was YES. [2025-02-08 05:31:47,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31371 conditions, 8668 events. 2409/8668 cut-off events. For 36196/36481 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 85456 event pairs, 219 based on Foata normal form. 82/8548 useless extension candidates. Maximal degree in co-relation 31252. Up to 1703 conditions per place. [2025-02-08 05:31:47,376 INFO L140 encePairwiseOnDemand]: 164/199 looper letters, 511 selfloop transitions, 329 changer transitions 2/985 dead transitions. [2025-02-08 05:31:47,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 985 transitions, 12297 flow [2025-02-08 05:31:47,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 05:31:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 05:31:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2718 transitions. [2025-02-08 05:31:47,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7188574451203386 [2025-02-08 05:31:47,380 INFO L175 Difference]: Start difference. First operand has 286 places, 653 transitions, 6958 flow. Second operand 19 states and 2718 transitions. [2025-02-08 05:31:47,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 985 transitions, 12297 flow [2025-02-08 05:31:47,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 985 transitions, 12270 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-02-08 05:31:47,480 INFO L231 Difference]: Finished difference. Result has 316 places, 787 transitions, 10473 flow [2025-02-08 05:31:47,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=6931, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10473, PETRI_PLACES=316, PETRI_TRANSITIONS=787} [2025-02-08 05:31:47,481 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 114 predicate places. [2025-02-08 05:31:47,482 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 787 transitions, 10473 flow [2025-02-08 05:31:47,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.07692307692307) internal successors, (1730), 13 states have internal predecessors, (1730), 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-02-08 05:31:47,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:47,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:47,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:31:47,483 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:47,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash 758041143, now seen corresponding path program 1 times [2025-02-08 05:31:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:47,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677056792] [2025-02-08 05:31:47,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:47,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:31:47,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:31:47,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:47,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:48,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:48,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677056792] [2025-02-08 05:31:48,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677056792] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:48,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951260048] [2025-02-08 05:31:48,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:48,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:48,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:48,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:48,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:31:48,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:31:48,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:31:48,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:48,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:48,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 05:31:48,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:48,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:31:48,305 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:31:48,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 05:31:48,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:31:48,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-08 05:31:48,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:31:48,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-02-08 05:31:48,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:31:48,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-02-08 05:31:48,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-02-08 05:31:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:48,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:31:48,483 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))))) is different from false [2025-02-08 05:31:48,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1021 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1021) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2))))))) is different from false [2025-02-08 05:31:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951260048] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:31:52,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:31:52,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-02-08 05:31:52,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609700387] [2025-02-08 05:31:52,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:31:52,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:31:52,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:52,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:31:52,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=190, Unknown=9, NotChecked=58, Total=306 [2025-02-08 05:31:52,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 199 [2025-02-08 05:31:52,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 787 transitions, 10473 flow. Second operand has 18 states, 18 states have (on average 98.5) internal successors, (1773), 18 states have internal predecessors, (1773), 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-02-08 05:31:52,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:52,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 199 [2025-02-08 05:31:52,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:56,025 INFO L124 PetriNetUnfolderBase]: 4686/13068 cut-off events. [2025-02-08 05:31:56,025 INFO L125 PetriNetUnfolderBase]: For 66182/66420 co-relation queries the response was YES. [2025-02-08 05:31:56,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51701 conditions, 13068 events. 4686/13068 cut-off events. For 66182/66420 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 124077 event pairs, 1219 based on Foata normal form. 78/12818 useless extension candidates. Maximal degree in co-relation 51560. Up to 4099 conditions per place. [2025-02-08 05:31:56,107 INFO L140 encePairwiseOnDemand]: 178/199 looper letters, 724 selfloop transitions, 179 changer transitions 0/990 dead transitions. [2025-02-08 05:31:56,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 990 transitions, 14575 flow [2025-02-08 05:31:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 05:31:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 05:31:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1559 transitions. [2025-02-08 05:31:56,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595836324479541 [2025-02-08 05:31:56,110 INFO L175 Difference]: Start difference. First operand has 316 places, 787 transitions, 10473 flow. Second operand 14 states and 1559 transitions. [2025-02-08 05:31:56,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 990 transitions, 14575 flow [2025-02-08 05:31:56,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 990 transitions, 14492 flow, removed 39 selfloop flow, removed 3 redundant places. [2025-02-08 05:31:56,321 INFO L231 Difference]: Finished difference. Result has 331 places, 802 transitions, 11222 flow [2025-02-08 05:31:56,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=10406, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=11222, PETRI_PLACES=331, PETRI_TRANSITIONS=802} [2025-02-08 05:31:56,322 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 129 predicate places. [2025-02-08 05:31:56,323 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 802 transitions, 11222 flow [2025-02-08 05:31:56,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 98.5) internal successors, (1773), 18 states have internal predecessors, (1773), 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-02-08 05:31:56,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:56,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:56,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:31:56,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 05:31:56,524 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-08 05:31:56,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash 532884896, now seen corresponding path program 5 times [2025-02-08 05:31:56,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:56,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662130031] [2025-02-08 05:31:56,525 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:31:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:56,545 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-02-08 05:31:56,553 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:31:56,553 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:31:56,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:56,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:56,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662130031] [2025-02-08 05:31:56,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662130031] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:56,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521170356] [2025-02-08 05:31:56,914 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:31:56,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:56,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:56,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:56,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:31:57,011 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-02-08 05:31:57,048 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:31:57,048 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:31:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:57,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 05:31:57,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:57,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 05:31:57,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 05:31:57,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:31:57,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-02-08 05:31:57,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:31:57,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-02-08 05:31:57,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:31:57,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:31:57,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:31:57,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:31:57,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:31:57,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 49 [2025-02-08 05:31:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:57,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:09,576 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:32:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:09,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521170356] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:09,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:09,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-02-08 05:32:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44691569] [2025-02-08 05:32:09,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:09,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 05:32:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:09,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 05:32:09,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=976, Unknown=2, NotChecked=0, Total=1122 [2025-02-08 05:32:14,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:32:17,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:32:21,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:32:26,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:32:30,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:32:33,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:32:37,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:32:41,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:32:45,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:32:50,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:32:55,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 05:33:00,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]