./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:36:24,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:36:25,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:36:25,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:36:25,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:36:25,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:36:25,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:36:25,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:36:25,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:36:25,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:36:25,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:36:25,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:36:25,072 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:36:25,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:36:25,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:36:25,072 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:36:25,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:36:25,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:36:25,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:36:25,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:36:25,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:36:25,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:36:25,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:36:25,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:36:25,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:36:25,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:36:25,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:36:25,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:36:25,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:36:25,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:36:25,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:36:25,075 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/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 -> c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 [2025-03-14 01:36:25,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:36:25,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:36:25,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:36:25,304 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:36:25,304 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:36:25,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2025-03-14 01:36:26,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c99d26f52/e8301f4292644f3fa5b52f63c098fc2b/FLAGd41ac595d [2025-03-14 01:36:26,720 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:36:26,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2025-03-14 01:36:26,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c99d26f52/e8301f4292644f3fa5b52f63c098fc2b/FLAGd41ac595d [2025-03-14 01:36:26,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c99d26f52/e8301f4292644f3fa5b52f63c098fc2b [2025-03-14 01:36:26,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:36:26,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:36:26,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:36:26,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:36:26,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:36:26,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:36:26" (1/1) ... [2025-03-14 01:36:26,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b90895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:26, skipping insertion in model container [2025-03-14 01:36:26,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:36:26" (1/1) ... [2025-03-14 01:36:26,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:36:27,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:36:27,090 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:36:27,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:36:27,171 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:36:27,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27 WrapperNode [2025-03-14 01:36:27,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:36:27,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:36:27,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:36:27,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:36:27,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,205 INFO L138 Inliner]: procedures = 189, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 258 [2025-03-14 01:36:27,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:36:27,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:36:27,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:36:27,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:36:27,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,230 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:36:27,237 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:36:27,237 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:36:27,237 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:36:27,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (1/1) ... [2025-03-14 01:36:27,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:36:27,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:36:27,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:36:27,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:36:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:36:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:36:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:36:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:36:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:36:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:36:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:36:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:36:27,286 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:36:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:36:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:36:27,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:36:27,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:36:27,287 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:36:27,381 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:36:27,382 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:36:27,759 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:36:27,760 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:36:27,760 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:36:27,796 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:36:27,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:36:27 BoogieIcfgContainer [2025-03-14 01:36:27,798 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:36:27,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:36:27,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:36:27,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:36:27,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:36:26" (1/3) ... [2025-03-14 01:36:27,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b6e4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:36:27, skipping insertion in model container [2025-03-14 01:36:27,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:27" (2/3) ... [2025-03-14 01:36:27,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b6e4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:36:27, skipping insertion in model container [2025-03-14 01:36:27,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:36:27" (3/3) ... [2025-03-14 01:36:27,806 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_06-ptra_nr.i [2025-03-14 01:36:27,816 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:36:27,817 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_06-ptra_nr.i that has 2 procedures, 294 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-14 01:36:27,817 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:36:27,889 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:36:27,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 293 transitions, 590 flow [2025-03-14 01:36:28,019 INFO L124 PetriNetUnfolderBase]: 0/292 cut-off events. [2025-03-14 01:36:28,022 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:28,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 292 events. 0/292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 114 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-14 01:36:28,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 293 transitions, 590 flow [2025-03-14 01:36:28,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 292 transitions, 587 flow [2025-03-14 01:36:28,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:36:28,042 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;@51f951e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:36:28,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-14 01:36:28,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:36:28,059 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-14 01:36:28,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:28,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:28,060 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] [2025-03-14 01:36:28,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:28,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash 663189225, now seen corresponding path program 1 times [2025-03-14 01:36:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:28,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717276412] [2025-03-14 01:36:28,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:28,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-14 01:36:28,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-14 01:36:28,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:28,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:28,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717276412] [2025-03-14 01:36:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717276412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:28,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:28,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:28,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324770325] [2025-03-14 01:36:28,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:28,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:28,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:28,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:29,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2025-03-14 01:36:29,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 292 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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-03-14 01:36:29,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:29,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2025-03-14 01:36:29,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:29,409 INFO L124 PetriNetUnfolderBase]: 220/1135 cut-off events. [2025-03-14 01:36:29,410 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:36:29,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 1135 events. 220/1135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5615 event pairs, 220 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1424. Up to 493 conditions per place. [2025-03-14 01:36:29,420 INFO L140 encePairwiseOnDemand]: 275/293 looper letters, 52 selfloop transitions, 15 changer transitions 0/289 dead transitions. [2025-03-14 01:36:29,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 289 transitions, 715 flow [2025-03-14 01:36:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-03-14 01:36:29,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800910125142207 [2025-03-14 01:36:29,439 INFO L175 Difference]: Start difference. First operand has 296 places, 292 transitions, 587 flow. Second operand 6 states and 1408 transitions. [2025-03-14 01:36:29,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 289 transitions, 715 flow [2025-03-14 01:36:29,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 289 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:36:29,449 INFO L231 Difference]: Finished difference. Result has 297 places, 289 transitions, 610 flow [2025-03-14 01:36:29,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=297, PETRI_TRANSITIONS=289} [2025-03-14 01:36:29,454 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 1 predicate places. [2025-03-14 01:36:29,455 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 289 transitions, 610 flow [2025-03-14 01:36:29,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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-03-14 01:36:29,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:29,456 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] [2025-03-14 01:36:29,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:36:29,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:29,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash -965088443, now seen corresponding path program 1 times [2025-03-14 01:36:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384768901] [2025-03-14 01:36:29,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:29,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-14 01:36:29,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:36:29,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:29,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:29,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-03-14 01:36:29,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384768901] [2025-03-14 01:36:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384768901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:29,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:29,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563011405] [2025-03-14 01:36:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:29,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:29,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:29,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:30,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 293 [2025-03-14 01:36:30,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 289 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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-03-14 01:36:30,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:30,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 293 [2025-03-14 01:36:30,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:30,350 INFO L124 PetriNetUnfolderBase]: 220/1132 cut-off events. [2025-03-14 01:36:30,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:30,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1132 events. 220/1132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5630 event pairs, 220 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1449. Up to 493 conditions per place. [2025-03-14 01:36:30,356 INFO L140 encePairwiseOnDemand]: 275/293 looper letters, 52 selfloop transitions, 15 changer transitions 0/286 dead transitions. [2025-03-14 01:36:30,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 286 transitions, 738 flow [2025-03-14 01:36:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-03-14 01:36:30,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800910125142207 [2025-03-14 01:36:30,361 INFO L175 Difference]: Start difference. First operand has 297 places, 289 transitions, 610 flow. Second operand 6 states and 1408 transitions. [2025-03-14 01:36:30,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 286 transitions, 738 flow [2025-03-14 01:36:30,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 286 transitions, 708 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:30,369 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 604 flow [2025-03-14 01:36:30,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2025-03-14 01:36:30,369 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -2 predicate places. [2025-03-14 01:36:30,369 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 604 flow [2025-03-14 01:36:30,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 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-03-14 01:36:30,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:30,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:30,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:36:30,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:30,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:30,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1902688389, now seen corresponding path program 1 times [2025-03-14 01:36:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:30,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834409730] [2025-03-14 01:36:30,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:30,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-14 01:36:30,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-14 01:36:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:30,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:30,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834409730] [2025-03-14 01:36:30,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834409730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:30,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:30,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:30,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459714348] [2025-03-14 01:36:30,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:30,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:30,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:30,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:30,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 293 [2025-03-14 01:36:30,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-03-14 01:36:30,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:30,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 293 [2025-03-14 01:36:30,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:30,542 INFO L124 PetriNetUnfolderBase]: 16/421 cut-off events. [2025-03-14 01:36:30,543 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:30,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 421 events. 16/421 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 787 event pairs, 16 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 291. Up to 47 conditions per place. [2025-03-14 01:36:30,545 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 14 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-14 01:36:30,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 285 transitions, 634 flow [2025-03-14 01:36:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2025-03-14 01:36:30,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9613196814562003 [2025-03-14 01:36:30,549 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 604 flow. Second operand 3 states and 845 transitions. [2025-03-14 01:36:30,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 285 transitions, 634 flow [2025-03-14 01:36:30,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 285 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:30,553 INFO L231 Difference]: Finished difference. Result has 290 places, 285 transitions, 576 flow [2025-03-14 01:36:30,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=290, PETRI_TRANSITIONS=285} [2025-03-14 01:36:30,554 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -6 predicate places. [2025-03-14 01:36:30,554 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 285 transitions, 576 flow [2025-03-14 01:36:30,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-03-14 01:36:30,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:30,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:30,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:36:30,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:30,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:30,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1501075089, now seen corresponding path program 1 times [2025-03-14 01:36:30,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:30,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408732403] [2025-03-14 01:36:30,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:30,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:30,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-14 01:36:30,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-14 01:36:30,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:30,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408732403] [2025-03-14 01:36:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408732403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:30,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:30,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:30,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002154003] [2025-03-14 01:36:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:30,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:30,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:30,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:30,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 293 [2025-03-14 01:36:30,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 285 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-03-14 01:36:30,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:30,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 293 [2025-03-14 01:36:30,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:30,682 INFO L124 PetriNetUnfolderBase]: 24/498 cut-off events. [2025-03-14 01:36:30,682 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:36:30,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 498 events. 24/498 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1231 event pairs, 24 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 458. Up to 63 conditions per place. [2025-03-14 01:36:30,684 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 15 selfloop transitions, 1 changer transitions 0/280 dead transitions. [2025-03-14 01:36:30,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 280 transitions, 598 flow [2025-03-14 01:36:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2025-03-14 01:36:30,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522184300341296 [2025-03-14 01:36:30,686 INFO L175 Difference]: Start difference. First operand has 290 places, 285 transitions, 576 flow. Second operand 3 states and 837 transitions. [2025-03-14 01:36:30,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 280 transitions, 598 flow [2025-03-14 01:36:30,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 280 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:36:30,690 INFO L231 Difference]: Finished difference. Result has 285 places, 280 transitions, 564 flow [2025-03-14 01:36:30,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=285, PETRI_TRANSITIONS=280} [2025-03-14 01:36:30,691 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -11 predicate places. [2025-03-14 01:36:30,691 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 280 transitions, 564 flow [2025-03-14 01:36:30,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-03-14 01:36:30,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:30,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:36:30,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:36:30,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:30,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash -507763959, now seen corresponding path program 1 times [2025-03-14 01:36:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:30,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669447520] [2025-03-14 01:36:30,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:30,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:30,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-14 01:36:30,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-14 01:36:30,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:30,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:31,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669447520] [2025-03-14 01:36:31,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669447520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:31,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:31,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:31,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060177621] [2025-03-14 01:36:31,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:31,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:31,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:31,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:31,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:31,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 293 [2025-03-14 01:36:31,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 280 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 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-03-14 01:36:31,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:31,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 293 [2025-03-14 01:36:31,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:31,515 INFO L124 PetriNetUnfolderBase]: 288/1275 cut-off events. [2025-03-14 01:36:31,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:31,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 1275 events. 288/1275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6623 event pairs, 288 based on Foata normal form. 0/1214 useless extension candidates. Maximal degree in co-relation 1807. Up to 643 conditions per place. [2025-03-14 01:36:31,520 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 66 selfloop transitions, 5 changer transitions 0/279 dead transitions. [2025-03-14 01:36:31,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 279 transitions, 704 flow [2025-03-14 01:36:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1398 transitions. [2025-03-14 01:36:31,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7952218430034129 [2025-03-14 01:36:31,523 INFO L175 Difference]: Start difference. First operand has 285 places, 280 transitions, 564 flow. Second operand 6 states and 1398 transitions. [2025-03-14 01:36:31,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 279 transitions, 704 flow [2025-03-14 01:36:31,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 279 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:36:31,526 INFO L231 Difference]: Finished difference. Result has 288 places, 279 transitions, 571 flow [2025-03-14 01:36:31,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=288, PETRI_TRANSITIONS=279} [2025-03-14 01:36:31,527 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -8 predicate places. [2025-03-14 01:36:31,527 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 279 transitions, 571 flow [2025-03-14 01:36:31,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 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-03-14 01:36:31,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:31,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:31,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:36:31,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:31,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash -661294820, now seen corresponding path program 1 times [2025-03-14 01:36:31,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:31,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017104004] [2025-03-14 01:36:31,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:31,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:31,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-14 01:36:31,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-14 01:36:31,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:31,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:31,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:31,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017104004] [2025-03-14 01:36:31,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017104004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:31,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:31,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611403178] [2025-03-14 01:36:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:31,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:31,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:31,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:31,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 293 [2025-03-14 01:36:31,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 279 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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-03-14 01:36:31,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:31,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 293 [2025-03-14 01:36:31,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:31,626 INFO L124 PetriNetUnfolderBase]: 6/342 cut-off events. [2025-03-14 01:36:31,627 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:31,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 342 events. 6/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 393 event pairs, 6 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 266. Up to 23 conditions per place. [2025-03-14 01:36:31,628 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 10 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-03-14 01:36:31,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 278 transitions, 593 flow [2025-03-14 01:36:31,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-03-14 01:36:31,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704209328782708 [2025-03-14 01:36:31,631 INFO L175 Difference]: Start difference. First operand has 288 places, 279 transitions, 571 flow. Second operand 3 states and 853 transitions. [2025-03-14 01:36:31,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 278 transitions, 593 flow [2025-03-14 01:36:31,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 278 transitions, 583 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:31,634 INFO L231 Difference]: Finished difference. Result has 284 places, 278 transitions, 563 flow [2025-03-14 01:36:31,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=284, PETRI_TRANSITIONS=278} [2025-03-14 01:36:31,636 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -12 predicate places. [2025-03-14 01:36:31,637 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 278 transitions, 563 flow [2025-03-14 01:36:31,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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-03-14 01:36:31,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:36:31,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:36:31,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:31,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1062513940, now seen corresponding path program 1 times [2025-03-14 01:36:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:31,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462895809] [2025-03-14 01:36:31,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:31,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-14 01:36:31,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-14 01:36:31,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:31,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:31,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:31,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462895809] [2025-03-14 01:36:31,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462895809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:31,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:31,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862806525] [2025-03-14 01:36:31,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:31,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:31,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:31,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:31,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:31,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 293 [2025-03-14 01:36:31,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 278 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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-03-14 01:36:31,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:31,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 293 [2025-03-14 01:36:31,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:31,726 INFO L124 PetriNetUnfolderBase]: 4/339 cut-off events. [2025-03-14 01:36:31,727 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:36:31,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 339 events. 4/339 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 247 event pairs, 4 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 253. Up to 15 conditions per place. [2025-03-14 01:36:31,728 INFO L140 encePairwiseOnDemand]: 291/293 looper letters, 7 selfloop transitions, 1 changer transitions 0/277 dead transitions. [2025-03-14 01:36:31,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 277 transitions, 577 flow [2025-03-14 01:36:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-03-14 01:36:31,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9795221843003413 [2025-03-14 01:36:31,730 INFO L175 Difference]: Start difference. First operand has 284 places, 278 transitions, 563 flow. Second operand 3 states and 861 transitions. [2025-03-14 01:36:31,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 277 transitions, 577 flow [2025-03-14 01:36:31,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 277 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:36:31,733 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 559 flow [2025-03-14 01:36:31,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2025-03-14 01:36:31,734 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -13 predicate places. [2025-03-14 01:36:31,734 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 559 flow [2025-03-14 01:36:31,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 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-03-14 01:36:31,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:31,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:31,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:36:31,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:31,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash 699734421, now seen corresponding path program 1 times [2025-03-14 01:36:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:31,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175924485] [2025-03-14 01:36:31,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:31,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:31,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-14 01:36:31,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-14 01:36:31,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:31,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:32,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:32,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175924485] [2025-03-14 01:36:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175924485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:32,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416440125] [2025-03-14 01:36:32,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:32,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:32,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:32,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:32,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 293 [2025-03-14 01:36:32,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 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-03-14 01:36:32,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:32,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 293 [2025-03-14 01:36:32,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:32,718 INFO L124 PetriNetUnfolderBase]: 316/1589 cut-off events. [2025-03-14 01:36:32,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:32,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 1589 events. 316/1589 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9551 event pairs, 43 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 2209. Up to 388 conditions per place. [2025-03-14 01:36:32,724 INFO L140 encePairwiseOnDemand]: 265/293 looper letters, 107 selfloop transitions, 70 changer transitions 0/389 dead transitions. [2025-03-14 01:36:32,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 389 transitions, 1137 flow [2025-03-14 01:36:32,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1547 transitions. [2025-03-14 01:36:32,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8799772468714449 [2025-03-14 01:36:32,728 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 559 flow. Second operand 6 states and 1547 transitions. [2025-03-14 01:36:32,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 389 transitions, 1137 flow [2025-03-14 01:36:32,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 389 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:36:32,737 INFO L231 Difference]: Finished difference. Result has 291 places, 347 transitions, 1036 flow [2025-03-14 01:36:32,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1036, PETRI_PLACES=291, PETRI_TRANSITIONS=347} [2025-03-14 01:36:32,739 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -5 predicate places. [2025-03-14 01:36:32,739 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 347 transitions, 1036 flow [2025-03-14 01:36:32,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.33333333333334) internal successors, (1406), 6 states have internal predecessors, (1406), 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-03-14 01:36:32,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:32,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:32,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:36:32,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:32,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1394376837, now seen corresponding path program 1 times [2025-03-14 01:36:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:32,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014823590] [2025-03-14 01:36:32,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:32,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:32,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-14 01:36:32,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-14 01:36:32,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:32,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:33,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:33,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014823590] [2025-03-14 01:36:33,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014823590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:33,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:33,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605049216] [2025-03-14 01:36:33,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:33,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:33,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:33,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:33,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 293 [2025-03-14 01:36:33,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 347 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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-03-14 01:36:33,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:33,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 293 [2025-03-14 01:36:33,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:33,729 INFO L124 PetriNetUnfolderBase]: 588/2368 cut-off events. [2025-03-14 01:36:33,730 INFO L125 PetriNetUnfolderBase]: For 603/609 co-relation queries the response was YES. [2025-03-14 01:36:33,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 2368 events. 588/2368 cut-off events. For 603/609 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 15342 event pairs, 222 based on Foata normal form. 0/2256 useless extension candidates. Maximal degree in co-relation 4644. Up to 1090 conditions per place. [2025-03-14 01:36:33,742 INFO L140 encePairwiseOnDemand]: 278/293 looper letters, 114 selfloop transitions, 48 changer transitions 0/398 dead transitions. [2025-03-14 01:36:33,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 398 transitions, 1532 flow [2025-03-14 01:36:33,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2025-03-14 01:36:33,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441410693970421 [2025-03-14 01:36:33,745 INFO L175 Difference]: Start difference. First operand has 291 places, 347 transitions, 1036 flow. Second operand 6 states and 1484 transitions. [2025-03-14 01:36:33,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 398 transitions, 1532 flow [2025-03-14 01:36:33,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 398 transitions, 1532 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:33,753 INFO L231 Difference]: Finished difference. Result has 301 places, 390 transitions, 1424 flow [2025-03-14 01:36:33,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1424, PETRI_PLACES=301, PETRI_TRANSITIONS=390} [2025-03-14 01:36:33,753 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 5 predicate places. [2025-03-14 01:36:33,753 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 390 transitions, 1424 flow [2025-03-14 01:36:33,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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-03-14 01:36:33,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:33,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:33,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:36:33,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:33,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash 382575935, now seen corresponding path program 1 times [2025-03-14 01:36:33,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:33,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426403826] [2025-03-14 01:36:33,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:33,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:33,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-14 01:36:33,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-14 01:36:33,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:33,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:34,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:34,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426403826] [2025-03-14 01:36:34,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426403826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:34,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:34,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953984943] [2025-03-14 01:36:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:34,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:34,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:34,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:34,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:34,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 293 [2025-03-14 01:36:34,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 390 transitions, 1424 flow. Second operand has 6 states, 6 states have (on average 241.16666666666666) internal successors, (1447), 6 states have internal predecessors, (1447), 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-03-14 01:36:34,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:34,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 293 [2025-03-14 01:36:34,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:34,759 INFO L124 PetriNetUnfolderBase]: 689/2809 cut-off events. [2025-03-14 01:36:34,759 INFO L125 PetriNetUnfolderBase]: For 1552/1608 co-relation queries the response was YES. [2025-03-14 01:36:34,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6391 conditions, 2809 events. 689/2809 cut-off events. For 1552/1608 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19705 event pairs, 57 based on Foata normal form. 0/2722 useless extension candidates. Maximal degree in co-relation 6262. Up to 932 conditions per place. [2025-03-14 01:36:34,773 INFO L140 encePairwiseOnDemand]: 270/293 looper letters, 135 selfloop transitions, 136 changer transitions 4/530 dead transitions. [2025-03-14 01:36:34,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 530 transitions, 2730 flow [2025-03-14 01:36:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1547 transitions. [2025-03-14 01:36:34,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8799772468714449 [2025-03-14 01:36:34,776 INFO L175 Difference]: Start difference. First operand has 301 places, 390 transitions, 1424 flow. Second operand 6 states and 1547 transitions. [2025-03-14 01:36:34,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 530 transitions, 2730 flow [2025-03-14 01:36:34,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 530 transitions, 2712 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:34,790 INFO L231 Difference]: Finished difference. Result has 311 places, 521 transitions, 2772 flow [2025-03-14 01:36:34,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2772, PETRI_PLACES=311, PETRI_TRANSITIONS=521} [2025-03-14 01:36:34,790 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 15 predicate places. [2025-03-14 01:36:34,790 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 521 transitions, 2772 flow [2025-03-14 01:36:34,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 241.16666666666666) internal successors, (1447), 6 states have internal predecessors, (1447), 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-03-14 01:36:34,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:34,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:34,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:36:34,791 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:34,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash -432114817, now seen corresponding path program 1 times [2025-03-14 01:36:34,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:34,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746754207] [2025-03-14 01:36:34,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:34,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-14 01:36:34,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-14 01:36:34,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:34,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:35,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746754207] [2025-03-14 01:36:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746754207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:35,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457911676] [2025-03-14 01:36:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:35,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:35,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:35,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:35,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:35,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 293 [2025-03-14 01:36:35,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 521 transitions, 2772 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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-03-14 01:36:35,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:35,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 293 [2025-03-14 01:36:35,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:35,757 INFO L124 PetriNetUnfolderBase]: 968/3493 cut-off events. [2025-03-14 01:36:35,757 INFO L125 PetriNetUnfolderBase]: For 3836/3908 co-relation queries the response was YES. [2025-03-14 01:36:35,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9734 conditions, 3493 events. 968/3493 cut-off events. For 3836/3908 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 24929 event pairs, 207 based on Foata normal form. 0/3406 useless extension candidates. Maximal degree in co-relation 9602. Up to 1565 conditions per place. [2025-03-14 01:36:35,782 INFO L140 encePairwiseOnDemand]: 278/293 looper letters, 239 selfloop transitions, 62 changer transitions 0/578 dead transitions. [2025-03-14 01:36:35,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 578 transitions, 3716 flow [2025-03-14 01:36:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2025-03-14 01:36:35,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441410693970421 [2025-03-14 01:36:35,785 INFO L175 Difference]: Start difference. First operand has 311 places, 521 transitions, 2772 flow. Second operand 6 states and 1484 transitions. [2025-03-14 01:36:35,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 578 transitions, 3716 flow [2025-03-14 01:36:35,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 578 transitions, 3680 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:35,844 INFO L231 Difference]: Finished difference. Result has 321 places, 570 transitions, 3362 flow [2025-03-14 01:36:35,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=2736, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3362, PETRI_PLACES=321, PETRI_TRANSITIONS=570} [2025-03-14 01:36:35,845 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 25 predicate places. [2025-03-14 01:36:35,845 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 570 transitions, 3362 flow [2025-03-14 01:36:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 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-03-14 01:36:35,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:35,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:35,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:36:35,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:35,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1351092406, now seen corresponding path program 1 times [2025-03-14 01:36:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:35,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587372967] [2025-03-14 01:36:35,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:35,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-14 01:36:35,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:36:35,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:35,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:36,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587372967] [2025-03-14 01:36:36,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587372967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:36,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:36,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:36:36,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510952388] [2025-03-14 01:36:36,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:36,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:36:36,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:36,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:36:36,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:36:37,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-03-14 01:36:37,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 570 transitions, 3362 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-14 01:36:37,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:37,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-03-14 01:36:37,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:39,026 INFO L124 PetriNetUnfolderBase]: 1482/5034 cut-off events. [2025-03-14 01:36:39,026 INFO L125 PetriNetUnfolderBase]: For 8566/8666 co-relation queries the response was YES. [2025-03-14 01:36:39,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 5034 events. 1482/5034 cut-off events. For 8566/8666 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 40103 event pairs, 100 based on Foata normal form. 47/4999 useless extension candidates. Maximal degree in co-relation 15887. Up to 955 conditions per place. [2025-03-14 01:36:39,052 INFO L140 encePairwiseOnDemand]: 260/293 looper letters, 442 selfloop transitions, 192 changer transitions 1/881 dead transitions. [2025-03-14 01:36:39,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 881 transitions, 7168 flow [2025-03-14 01:36:39,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:36:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:36:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4321 transitions. [2025-03-14 01:36:39,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776181067001976 [2025-03-14 01:36:39,058 INFO L175 Difference]: Start difference. First operand has 321 places, 570 transitions, 3362 flow. Second operand 19 states and 4321 transitions. [2025-03-14 01:36:39,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 881 transitions, 7168 flow [2025-03-14 01:36:39,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 881 transitions, 6986 flow, removed 91 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:39,097 INFO L231 Difference]: Finished difference. Result has 348 places, 701 transitions, 5266 flow [2025-03-14 01:36:39,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=3250, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5266, PETRI_PLACES=348, PETRI_TRANSITIONS=701} [2025-03-14 01:36:39,098 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 52 predicate places. [2025-03-14 01:36:39,098 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 701 transitions, 5266 flow [2025-03-14 01:36:39,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-14 01:36:39,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:39,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:36:39,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:39,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1130547726, now seen corresponding path program 2 times [2025-03-14 01:36:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639090435] [2025-03-14 01:36:39,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:36:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:39,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 1 equivalence classes. [2025-03-14 01:36:39,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:36:39,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:36:39,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:39,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:39,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639090435] [2025-03-14 01:36:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639090435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:39,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:36:39,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560692454] [2025-03-14 01:36:39,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:39,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:36:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:39,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:36:39,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:36:40,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-03-14 01:36:40,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 701 transitions, 5266 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-14 01:36:40,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:40,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-03-14 01:36:40,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:42,342 INFO L124 PetriNetUnfolderBase]: 2096/7121 cut-off events. [2025-03-14 01:36:42,342 INFO L125 PetriNetUnfolderBase]: For 17124/17324 co-relation queries the response was YES. [2025-03-14 01:36:42,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24318 conditions, 7121 events. 2096/7121 cut-off events. For 17124/17324 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 64303 event pairs, 147 based on Foata normal form. 64/7084 useless extension candidates. Maximal degree in co-relation 24163. Up to 1553 conditions per place. [2025-03-14 01:36:42,385 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 444 selfloop transitions, 258 changer transitions 4/952 dead transitions. [2025-03-14 01:36:42,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 952 transitions, 8766 flow [2025-03-14 01:36:42,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 01:36:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 01:36:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3289 transitions. [2025-03-14 01:36:42,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8018039980497318 [2025-03-14 01:36:42,390 INFO L175 Difference]: Start difference. First operand has 348 places, 701 transitions, 5266 flow. Second operand 14 states and 3289 transitions. [2025-03-14 01:36:42,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 952 transitions, 8766 flow [2025-03-14 01:36:42,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 952 transitions, 8703 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:42,463 INFO L231 Difference]: Finished difference. Result has 366 places, 780 transitions, 7383 flow [2025-03-14 01:36:42,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=5225, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7383, PETRI_PLACES=366, PETRI_TRANSITIONS=780} [2025-03-14 01:36:42,465 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 70 predicate places. [2025-03-14 01:36:42,465 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 780 transitions, 7383 flow [2025-03-14 01:36:42,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-14 01:36:42,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:42,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:42,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:36:42,466 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:42,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash -501291006, now seen corresponding path program 3 times [2025-03-14 01:36:42,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:42,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385695461] [2025-03-14 01:36:42,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:36:42,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:42,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 202 statements into 1 equivalence classes. [2025-03-14 01:36:42,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:36:42,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:36:42,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:43,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:43,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385695461] [2025-03-14 01:36:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385695461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:43,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:43,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:36:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377957340] [2025-03-14 01:36:43,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:43,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:36:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:43,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:36:43,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:36:43,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 293 [2025-03-14 01:36:43,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 780 transitions, 7383 flow. Second operand has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-14 01:36:43,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:43,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 293 [2025-03-14 01:36:43,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:45,370 INFO L124 PetriNetUnfolderBase]: 2168/7348 cut-off events. [2025-03-14 01:36:45,370 INFO L125 PetriNetUnfolderBase]: For 26079/26309 co-relation queries the response was YES. [2025-03-14 01:36:45,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27164 conditions, 7348 events. 2168/7348 cut-off events. For 26079/26309 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 66323 event pairs, 208 based on Foata normal form. 82/7316 useless extension candidates. Maximal degree in co-relation 26998. Up to 1395 conditions per place. [2025-03-14 01:36:45,419 INFO L140 encePairwiseOnDemand]: 268/293 looper letters, 538 selfloop transitions, 173 changer transitions 1/958 dead transitions. [2025-03-14 01:36:45,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 958 transitions, 10427 flow [2025-03-14 01:36:45,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:36:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:36:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4296 transitions. [2025-03-14 01:36:45,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7716903179450332 [2025-03-14 01:36:45,425 INFO L175 Difference]: Start difference. First operand has 366 places, 780 transitions, 7383 flow. Second operand 19 states and 4296 transitions. [2025-03-14 01:36:45,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 958 transitions, 10427 flow [2025-03-14 01:36:45,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 958 transitions, 10422 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:36:45,529 INFO L231 Difference]: Finished difference. Result has 390 places, 837 transitions, 8650 flow [2025-03-14 01:36:45,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=7378, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8650, PETRI_PLACES=390, PETRI_TRANSITIONS=837} [2025-03-14 01:36:45,531 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 94 predicate places. [2025-03-14 01:36:45,531 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 837 transitions, 8650 flow [2025-03-14 01:36:45,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 219.69230769230768) internal successors, (2856), 13 states have internal predecessors, (2856), 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-03-14 01:36:45,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:45,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:45,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:36:45,532 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:45,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:45,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1819787964, now seen corresponding path program 4 times [2025-03-14 01:36:45,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:45,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923894320] [2025-03-14 01:36:45,533 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:36:45,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:45,572 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 202 statements into 2 equivalence classes. [2025-03-14 01:36:45,588 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 186 of 202 statements. [2025-03-14 01:36:45,589 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:36:45,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:46,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:46,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923894320] [2025-03-14 01:36:46,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923894320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:36:46,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435064068] [2025-03-14 01:36:46,207 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:36:46,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:36:46,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:36:46,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:36:46,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:36:46,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 202 statements into 2 equivalence classes. [2025-03-14 01:36:46,399 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 186 of 202 statements. [2025-03-14 01:36:46,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:36:46,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:46,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-14 01:36:46,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:36:46,441 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-03-14 01:36:46,509 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:36:46,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:36:46,564 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 11 treesize of output 7 [2025-03-14 01:36:46,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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-03-14 01:36:46,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:46,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2025-03-14 01:36:46,647 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:36:46,647 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-03-14 01:36:46,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:46,664 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-03-14 01:36:46,756 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-03-14 01:36:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:46,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:36:46,790 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 3)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 2)) 0))) is different from false [2025-03-14 01:36:46,831 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 3)) 0))) is different from false [2025-03-14 01:36:46,958 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_1838 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_1838) c_~A~0.base) c_~A~0.offset) 0))))) is different from false [2025-03-14 01:36:47,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:47,334 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2025-03-14 01:36:47,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:47,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2025-03-14 01:36:47,346 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-14 01:36:47,346 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-03-14 01:36:47,350 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-14 01:36:47,350 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-03-14 01:36:47,354 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-14 01:36:47,355 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-03-14 01:36:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435064068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:36:47,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:36:47,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2025-03-14 01:36:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948221919] [2025-03-14 01:36:47,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:36:47,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:36:47,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:47,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:36:47,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=297, Unknown=25, NotChecked=114, Total=506 [2025-03-14 01:36:47,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 293 [2025-03-14 01:36:47,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 837 transitions, 8650 flow. Second operand has 23 states, 23 states have (on average 182.69565217391303) internal successors, (4202), 23 states have internal predecessors, (4202), 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-03-14 01:36:47,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:47,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 293 [2025-03-14 01:36:47,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:51,770 INFO L124 PetriNetUnfolderBase]: 4644/12994 cut-off events. [2025-03-14 01:36:51,770 INFO L125 PetriNetUnfolderBase]: For 51642/51974 co-relation queries the response was YES. [2025-03-14 01:36:51,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51997 conditions, 12994 events. 4644/12994 cut-off events. For 51642/51974 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 123128 event pairs, 859 based on Foata normal form. 80/12870 useless extension candidates. Maximal degree in co-relation 51816. Up to 3057 conditions per place. [2025-03-14 01:36:51,889 INFO L140 encePairwiseOnDemand]: 256/293 looper letters, 812 selfloop transitions, 295 changer transitions 8/1286 dead transitions. [2025-03-14 01:36:51,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 1286 transitions, 14874 flow [2025-03-14 01:36:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:36:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:36:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3079 transitions. [2025-03-14 01:36:51,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7005688282138794 [2025-03-14 01:36:51,892 INFO L175 Difference]: Start difference. First operand has 390 places, 837 transitions, 8650 flow. Second operand 15 states and 3079 transitions. [2025-03-14 01:36:51,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 1286 transitions, 14874 flow [2025-03-14 01:36:52,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1286 transitions, 14743 flow, removed 33 selfloop flow, removed 9 redundant places. [2025-03-14 01:36:52,118 INFO L231 Difference]: Finished difference. Result has 406 places, 923 transitions, 11320 flow [2025-03-14 01:36:52,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=8554, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11320, PETRI_PLACES=406, PETRI_TRANSITIONS=923} [2025-03-14 01:36:52,119 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 110 predicate places. [2025-03-14 01:36:52,119 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 923 transitions, 11320 flow [2025-03-14 01:36:52,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 182.69565217391303) internal successors, (4202), 23 states have internal predecessors, (4202), 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-03-14 01:36:52,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:52,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:52,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:36:52,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 01:36:52,321 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:52,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1003667844, now seen corresponding path program 1 times [2025-03-14 01:36:52,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:52,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175561173] [2025-03-14 01:36:52,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:52,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-14 01:36:52,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:36:52,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:52,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:53,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175561173] [2025-03-14 01:36:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175561173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:36:53,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152525450] [2025-03-14 01:36:53,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:53,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:36:53,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:36:53,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:36:53,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:36:53,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-14 01:36:53,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:36:53,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:53,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:53,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-14 01:36:53,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:36:53,415 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-03-14 01:36:53,476 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:36:53,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:36:53,525 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:36:53,525 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-03-14 01:36:53,572 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 13 treesize of output 9 [2025-03-14 01:36:53,590 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-03-14 01:36:53,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:53,615 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 32 treesize of output 34 [2025-03-14 01:36:53,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:53,646 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 41 treesize of output 46 [2025-03-14 01:36:53,680 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 45 treesize of output 34 [2025-03-14 01:36:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:53,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:36:53,700 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2142 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 7)))) (forall ((v_ArrVal_2142 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 6)))) (forall ((v_ArrVal_2142 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 4)) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|)) (forall ((v_ArrVal_2142 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 5)) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|))) is different from false [2025-03-14 01:36:53,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 7))) (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~nondet3#1|)))) (and (forall ((v_ArrVal_2142 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 5)))) (forall ((v_ArrVal_2142 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 4)))) (forall ((v_ArrVal_2142 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet3#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 6)))) (forall ((v_ArrVal_2142 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_2142) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet3#1|))))) is different from false [2025-03-14 01:36:57,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:57,540 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-03-14 01:36:57,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:57,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 28 [2025-03-14 01:36:57,551 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-14 01:36:57,552 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-14 01:36:57,556 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-14 01:36:57,557 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-14 01:36:57,562 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-14 01:36:57,562 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-14 01:36:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:57,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152525450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:36:57,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:36:57,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2025-03-14 01:36:57,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619317856] [2025-03-14 01:36:57,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:36:57,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 01:36:57,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:57,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 01:36:57,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=584, Unknown=37, NotChecked=102, Total=812 [2025-03-14 01:36:57,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 293 [2025-03-14 01:36:57,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 923 transitions, 11320 flow. Second operand has 29 states, 29 states have (on average 181.17241379310346) internal successors, (5254), 29 states have internal predecessors, (5254), 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-03-14 01:36:57,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:57,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 293 [2025-03-14 01:36:57,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:01,526 INFO L124 PetriNetUnfolderBase]: 4794/13342 cut-off events. [2025-03-14 01:37:01,526 INFO L125 PetriNetUnfolderBase]: For 68816/69094 co-relation queries the response was YES. [2025-03-14 01:37:01,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55817 conditions, 13342 events. 4794/13342 cut-off events. For 68816/69094 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 126706 event pairs, 977 based on Foata normal form. 83/13211 useless extension candidates. Maximal degree in co-relation 55625. Up to 4690 conditions per place. [2025-03-14 01:37:01,677 INFO L140 encePairwiseOnDemand]: 271/293 looper letters, 782 selfloop transitions, 174 changer transitions 0/1124 dead transitions. [2025-03-14 01:37:01,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1124 transitions, 15696 flow [2025-03-14 01:37:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 01:37:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 01:37:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2893 transitions. [2025-03-14 01:37:01,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6582480091012515 [2025-03-14 01:37:01,679 INFO L175 Difference]: Start difference. First operand has 406 places, 923 transitions, 11320 flow. Second operand 15 states and 2893 transitions. [2025-03-14 01:37:01,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1124 transitions, 15696 flow [2025-03-14 01:37:01,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1124 transitions, 15645 flow, removed 23 selfloop flow, removed 3 redundant places. [2025-03-14 01:37:01,929 INFO L231 Difference]: Finished difference. Result has 422 places, 938 transitions, 12105 flow [2025-03-14 01:37:01,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=11289, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12105, PETRI_PLACES=422, PETRI_TRANSITIONS=938} [2025-03-14 01:37:01,930 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 126 predicate places. [2025-03-14 01:37:01,930 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 938 transitions, 12105 flow [2025-03-14 01:37:01,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 181.17241379310346) internal successors, (5254), 29 states have internal predecessors, (5254), 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-03-14 01:37:01,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:01,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:01,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:37:02,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-14 01:37:02,133 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:37:02,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:02,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1371852126, now seen corresponding path program 5 times [2025-03-14 01:37:02,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:02,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649696018] [2025-03-14 01:37:02,134 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:37:02,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:02,161 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-14 01:37:02,185 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:37:02,185 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:37:02,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:03,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:03,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649696018] [2025-03-14 01:37:03,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649696018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:03,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272526886] [2025-03-14 01:37:03,066 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:37:03,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:03,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:03,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:03,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:37:03,214 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-14 01:37:03,378 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:37:03,378 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:37:03,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:03,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-14 01:37:03,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:03,396 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-03-14 01:37:03,521 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-14 01:37:03,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-14 01:37:03,689 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 11 treesize of output 7 [2025-03-14 01:37:03,711 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 19 treesize of output 18 [2025-03-14 01:37:03,757 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:37:03,757 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-03-14 01:37:03,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-14 01:37:03,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-14 01:37:04,008 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 37 treesize of output 26 [2025-03-14 01:37:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:04,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:04,336 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_2446 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) (+ c_~A~0.offset 1)))) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) (+ c_~A~0.offset 2)) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) .cse1) 0))))) is different from false [2025-03-14 01:37:04,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 2)) (.cse1 (+ c_~A~0.offset 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) c_~A~0.offset) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) (+ c_~A~0.offset 1)) 0)) (forall ((v_ArrVal_2446 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~malloc5#1.base| v_ArrVal_2446) c_~A~0.base) .cse2) 0))))) is different from false [2025-03-14 01:37:04,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:04,580 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51 [2025-03-14 01:37:04,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:04,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36 [2025-03-14 01:37:04,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-14 01:37:04,592 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-14 01:37:04,592 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-03-14 01:37:04,598 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-14 01:37:04,598 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2025-03-14 01:37:04,604 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-03-14 01:37:04,604 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-03-14 01:37:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272526886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:04,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:04,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 36 [2025-03-14 01:37:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924554412] [2025-03-14 01:37:04,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:04,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-14 01:37:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:04,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-14 01:37:04,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1007, Unknown=46, NotChecked=134, Total=1332 [2025-03-14 01:37:04,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 293 [2025-03-14 01:37:04,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 938 transitions, 12105 flow. Second operand has 37 states, 37 states have (on average 171.86486486486487) internal successors, (6359), 37 states have internal predecessors, (6359), 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-03-14 01:37:04,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:04,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 293 [2025-03-14 01:37:04,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:11,030 INFO L124 PetriNetUnfolderBase]: 6685/18730 cut-off events. [2025-03-14 01:37:11,030 INFO L125 PetriNetUnfolderBase]: For 106624/107140 co-relation queries the response was YES. [2025-03-14 01:37:11,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81935 conditions, 18730 events. 6685/18730 cut-off events. For 106624/107140 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 193732 event pairs, 1317 based on Foata normal form. 139/18598 useless extension candidates. Maximal degree in co-relation 81732. Up to 5974 conditions per place. [2025-03-14 01:37:11,236 INFO L140 encePairwiseOnDemand]: 252/293 looper letters, 777 selfloop transitions, 454 changer transitions 6/1398 dead transitions. [2025-03-14 01:37:11,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 1398 transitions, 20000 flow [2025-03-14 01:37:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:37:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:37:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3541 transitions. [2025-03-14 01:37:11,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6360696964253637 [2025-03-14 01:37:11,239 INFO L175 Difference]: Start difference. First operand has 422 places, 938 transitions, 12105 flow. Second operand 19 states and 3541 transitions. [2025-03-14 01:37:11,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 1398 transitions, 20000 flow [2025-03-14 01:37:11,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 1398 transitions, 19803 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-14 01:37:11,658 INFO L231 Difference]: Finished difference. Result has 441 places, 1075 transitions, 16747 flow [2025-03-14 01:37:11,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=11993, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=325, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=16747, PETRI_PLACES=441, PETRI_TRANSITIONS=1075} [2025-03-14 01:37:11,659 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 145 predicate places. [2025-03-14 01:37:11,659 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 1075 transitions, 16747 flow [2025-03-14 01:37:11,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 171.86486486486487) internal successors, (6359), 37 states have internal predecessors, (6359), 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-03-14 01:37:11,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:11,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:11,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:37:11,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:11,862 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:37:11,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1946691346, now seen corresponding path program 6 times [2025-03-14 01:37:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240469766] [2025-03-14 01:37:11,863 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:37:11,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:11,882 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 202 statements into 2 equivalence classes. [2025-03-14 01:37:11,900 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:37:11,900 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:37:11,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240469766] [2025-03-14 01:37:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240469766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381876278] [2025-03-14 01:37:12,669 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:37:12,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:12,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:12,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:37:12,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:37:12,824 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 202 statements into 2 equivalence classes. [2025-03-14 01:37:13,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:37:13,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:37:13,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:13,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-14 01:37:13,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:13,560 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-03-14 01:37:13,671 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 01:37:13,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-14 01:37:13,790 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:37:13,790 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-03-14 01:37:13,846 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-03-14 01:37:13,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-03-14 01:37:13,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-03-14 01:37:13,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-03-14 01:37:14,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-03-14 01:37:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:14,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381876278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:39,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:39,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-03-14 01:37:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72946363] [2025-03-14 01:37:39,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:39,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-14 01:37:39,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:39,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-14 01:37:39,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1009, Unknown=6, NotChecked=0, Total=1190 [2025-03-14 01:37:44,102 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-03-14 01:37:48,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:52,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]