./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:31:06,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:31:06,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:31:06,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:31:06,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:31:06,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:31:06,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:31:06,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:31:06,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:31:06,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:31:06,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:31:06,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:31:06,861 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:31:06,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:31:06,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:31:06,861 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:31:06,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:31:06,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:31:06,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:31:06,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:31:06,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:31:06,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:31:06,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:31:06,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:31:06,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:31:06,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:31:06,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:31:06,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:31:06,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:31:06,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:31:06,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:31:06,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:31:06,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a [2025-02-08 05:31:07,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:31:07,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:31:07,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:31:07,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:31:07,170 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:31:07,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2025-02-08 05:31:08,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/959ff899d/7e87558b1a5c4343ab6ca5e58a85d174/FLAGdf4ab5749 [2025-02-08 05:31:08,799 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:31:08,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2025-02-08 05:31:08,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/959ff899d/7e87558b1a5c4343ab6ca5e58a85d174/FLAGdf4ab5749 [2025-02-08 05:31:08,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/959ff899d/7e87558b1a5c4343ab6ca5e58a85d174 [2025-02-08 05:31:08,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:31:08,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:31:08,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:31:08,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:31:08,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:31:08,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3325e975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:08, skipping insertion in model container [2025-02-08 05:31:08,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:31:08" (1/1) ... [2025-02-08 05:31:08,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:31:09,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:31:09,253 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:31:09,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:31:09,355 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:31:09,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09 WrapperNode [2025-02-08 05:31:09,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:31:09,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:31:09,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:31:09,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:31:09,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,398 INFO L138 Inliner]: procedures = 263, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2025-02-08 05:31:09,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:31:09,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:31:09,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:31:09,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:31:09,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:31:09,441 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:31:09,441 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:31:09,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:31:09,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (1/1) ... [2025-02-08 05:31:09,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:31:09,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:09,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:31:09,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:31:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:31:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:31:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:31:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:31:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:31:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:31:09,497 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:31:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:31:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:31:09,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:31:09,498 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:31:09,600 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:31:09,601 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:31:09,918 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:31:09,918 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:31:09,937 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:31:09,937 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:31:09,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:31:09 BoogieIcfgContainer [2025-02-08 05:31:09,938 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:31:09,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:31:09,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:31:09,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:31:09,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:31:08" (1/3) ... [2025-02-08 05:31:09,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3e1829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:31:09, skipping insertion in model container [2025-02-08 05:31:09,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:31:09" (2/3) ... [2025-02-08 05:31:09,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3e1829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:31:09, skipping insertion in model container [2025-02-08 05:31:09,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:31:09" (3/3) ... [2025-02-08 05:31:09,945 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2025-02-08 05:31:09,956 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:31:09,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_05-funloop_hard2.i that has 2 procedures, 180 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-08 05:31:09,957 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:31:10,013 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:31:10,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 182 transitions, 368 flow [2025-02-08 05:31:10,140 INFO L124 PetriNetUnfolderBase]: 3/181 cut-off events. [2025-02-08 05:31:10,142 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:10,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 181 events. 3/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 230 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2025-02-08 05:31:10,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 182 transitions, 368 flow [2025-02-08 05:31:10,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 181 transitions, 365 flow [2025-02-08 05:31:10,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:31:10,184 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;@1311d26f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:31:10,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 05:31:10,223 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:31:10,223 INFO L124 PetriNetUnfolderBase]: 1/115 cut-off events. [2025-02-08 05:31:10,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:31:10,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:10,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:10,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:10,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1488094149, now seen corresponding path program 1 times [2025-02-08 05:31:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:10,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029597100] [2025-02-08 05:31:10,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:10,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:10,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:31:10,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:31:10,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:10,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:10,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:10,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029597100] [2025-02-08 05:31:10,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029597100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:10,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:31:10,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716373573] [2025-02-08 05:31:10,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:10,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:31:10,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:10,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:31:10,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:31:10,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 182 [2025-02-08 05:31:10,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 181 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:10,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:10,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 182 [2025-02-08 05:31:10,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:10,768 INFO L124 PetriNetUnfolderBase]: 15/321 cut-off events. [2025-02-08 05:31:10,768 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:10,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 321 events. 15/321 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 914 event pairs, 10 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 266. Up to 36 conditions per place. [2025-02-08 05:31:10,773 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 12 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-02-08 05:31:10,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 395 flow [2025-02-08 05:31:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:31:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:31:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-02-08 05:31:10,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560439560439561 [2025-02-08 05:31:10,794 INFO L175 Difference]: Start difference. First operand has 182 places, 181 transitions, 365 flow. Second operand 3 states and 522 transitions. [2025-02-08 05:31:10,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 395 flow [2025-02-08 05:31:10,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:10,806 INFO L231 Difference]: Finished difference. Result has 184 places, 182 transitions, 376 flow [2025-02-08 05:31:10,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=184, PETRI_TRANSITIONS=182} [2025-02-08 05:31:10,812 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 2 predicate places. [2025-02-08 05:31:10,815 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 182 transitions, 376 flow [2025-02-08 05:31:10,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:10,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:10,816 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] [2025-02-08 05:31:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:31:10,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash 120000725, now seen corresponding path program 1 times [2025-02-08 05:31:10,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2993843] [2025-02-08 05:31:10,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:10,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:31:10,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:31:10,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:10,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2993843] [2025-02-08 05:31:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2993843] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424444772] [2025-02-08 05:31:11,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:11,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:11,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:11,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:31:11,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:31:11,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:31:11,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:11,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:11,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 05:31:11,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:31:11,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:31:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424444772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:11,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:31:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-08 05:31:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461080412] [2025-02-08 05:31:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:11,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:31:11,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:11,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:31:11,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:11,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 182 [2025-02-08 05:31:11,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 182 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:11,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:11,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 182 [2025-02-08 05:31:11,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:11,353 INFO L124 PetriNetUnfolderBase]: 35/481 cut-off events. [2025-02-08 05:31:11,353 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:11,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 481 events. 35/481 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1724 event pairs, 10 based on Foata normal form. 3/450 useless extension candidates. Maximal degree in co-relation 481. Up to 51 conditions per place. [2025-02-08 05:31:11,360 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-02-08 05:31:11,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 187 transitions, 422 flow [2025-02-08 05:31:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:31:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:31:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-02-08 05:31:11,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633699633699634 [2025-02-08 05:31:11,364 INFO L175 Difference]: Start difference. First operand has 184 places, 182 transitions, 376 flow. Second operand 3 states and 526 transitions. [2025-02-08 05:31:11,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 187 transitions, 422 flow [2025-02-08 05:31:11,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 187 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:11,370 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 386 flow [2025-02-08 05:31:11,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-02-08 05:31:11,371 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-02-08 05:31:11,371 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 386 flow [2025-02-08 05:31:11,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:11,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:11,372 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-02-08 05:31:11,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 05:31:11,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:11,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:11,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash 706216788, now seen corresponding path program 1 times [2025-02-08 05:31:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:11,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708434216] [2025-02-08 05:31:11,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:11,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:31:11,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:31:11,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:11,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:11,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708434216] [2025-02-08 05:31:11,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708434216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417191838] [2025-02-08 05:31:11,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:11,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:11,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:11,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:11,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:31:11,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:31:11,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:31:11,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:11,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:11,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:31:11,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:11,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:31:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:11,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417191838] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:31:11,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:31:11,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:31:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699436147] [2025-02-08 05:31:11,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:31:11,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:11,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:11,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:11,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:31:11,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-02-08 05:31:11,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 386 flow. Second operand has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:11,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:11,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-02-08 05:31:11,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:12,189 INFO L124 PetriNetUnfolderBase]: 24/489 cut-off events. [2025-02-08 05:31:12,190 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:31:12,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 489 events. 24/489 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1556 event pairs, 14 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 458. Up to 51 conditions per place. [2025-02-08 05:31:12,196 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 16 selfloop transitions, 9 changer transitions 0/191 dead transitions. [2025-02-08 05:31:12,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 191 transitions, 454 flow [2025-02-08 05:31:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1521 transitions. [2025-02-08 05:31:12,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2025-02-08 05:31:12,200 INFO L175 Difference]: Start difference. First operand has 186 places, 183 transitions, 386 flow. Second operand 9 states and 1521 transitions. [2025-02-08 05:31:12,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 191 transitions, 454 flow [2025-02-08 05:31:12,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 191 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:12,204 INFO L231 Difference]: Finished difference. Result has 196 places, 189 transitions, 434 flow [2025-02-08 05:31:12,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=434, PETRI_PLACES=196, PETRI_TRANSITIONS=189} [2025-02-08 05:31:12,205 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 14 predicate places. [2025-02-08 05:31:12,205 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 189 transitions, 434 flow [2025-02-08 05:31:12,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:12,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:12,206 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:12,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 05:31:12,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:12,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:12,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1661637524, now seen corresponding path program 2 times [2025-02-08 05:31:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:12,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844000845] [2025-02-08 05:31:12,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:12,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:12,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-02-08 05:31:12,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 105 statements. [2025-02-08 05:31:12,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:12,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:31:12,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:12,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844000845] [2025-02-08 05:31:12,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844000845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:12,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:12,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:12,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621531317] [2025-02-08 05:31:12,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:12,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:12,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:12,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:13,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:13,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 189 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:13,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:13,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:13,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:13,541 INFO L124 PetriNetUnfolderBase]: 333/1545 cut-off events. [2025-02-08 05:31:13,542 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:31:13,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 1545 events. 333/1545 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10026 event pairs, 160 based on Foata normal form. 0/1455 useless extension candidates. Maximal degree in co-relation 2144. Up to 544 conditions per place. [2025-02-08 05:31:13,553 INFO L140 encePairwiseOnDemand]: 171/182 looper letters, 36 selfloop transitions, 22 changer transitions 0/218 dead transitions. [2025-02-08 05:31:13,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 218 transitions, 608 flow [2025-02-08 05:31:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 977 transitions. [2025-02-08 05:31:13,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8946886446886447 [2025-02-08 05:31:13,557 INFO L175 Difference]: Start difference. First operand has 196 places, 189 transitions, 434 flow. Second operand 6 states and 977 transitions. [2025-02-08 05:31:13,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 218 transitions, 608 flow [2025-02-08 05:31:13,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 218 transitions, 602 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:13,564 INFO L231 Difference]: Finished difference. Result has 205 places, 210 transitions, 578 flow [2025-02-08 05:31:13,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=205, PETRI_TRANSITIONS=210} [2025-02-08 05:31:13,566 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 23 predicate places. [2025-02-08 05:31:13,566 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 210 transitions, 578 flow [2025-02-08 05:31:13,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:13,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:13,567 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:13,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:31:13,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:13,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash -791398651, now seen corresponding path program 1 times [2025-02-08 05:31:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:13,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622356410] [2025-02-08 05:31:13,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:13,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:31:13,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:31:13,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:13,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:13,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:13,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622356410] [2025-02-08 05:31:13,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622356410] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:13,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647552106] [2025-02-08 05:31:13,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:13,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:13,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:13,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:13,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:31:13,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:31:13,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:31:13,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:13,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:13,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:31:13,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:13,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:31:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:14,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647552106] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:31:14,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:31:14,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 05:31:14,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553171117] [2025-02-08 05:31:14,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:31:14,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:31:14,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:14,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:31:14,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:31:14,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-02-08 05:31:14,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 210 transitions, 578 flow. Second operand has 18 states, 18 states have (on average 168.0) internal successors, (3024), 18 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:14,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:14,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-02-08 05:31:14,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:14,452 INFO L124 PetriNetUnfolderBase]: 118/1109 cut-off events. [2025-02-08 05:31:14,453 INFO L125 PetriNetUnfolderBase]: For 77/83 co-relation queries the response was YES. [2025-02-08 05:31:14,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 1109 events. 118/1109 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5920 event pairs, 24 based on Foata normal form. 4/1039 useless extension candidates. Maximal degree in co-relation 1418. Up to 133 conditions per place. [2025-02-08 05:31:14,462 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 20 selfloop transitions, 21 changer transitions 0/228 dead transitions. [2025-02-08 05:31:14,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 228 transitions, 748 flow [2025-02-08 05:31:14,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:31:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:31:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3531 transitions. [2025-02-08 05:31:14,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.923861852433281 [2025-02-08 05:31:14,470 INFO L175 Difference]: Start difference. First operand has 205 places, 210 transitions, 578 flow. Second operand 21 states and 3531 transitions. [2025-02-08 05:31:14,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 228 transitions, 748 flow [2025-02-08 05:31:14,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 228 transitions, 748 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:14,479 INFO L231 Difference]: Finished difference. Result has 230 places, 223 transitions, 708 flow [2025-02-08 05:31:14,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=708, PETRI_PLACES=230, PETRI_TRANSITIONS=223} [2025-02-08 05:31:14,482 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 48 predicate places. [2025-02-08 05:31:14,482 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 223 transitions, 708 flow [2025-02-08 05:31:14,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 168.0) internal successors, (3024), 18 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:14,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:14,485 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:14,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 05:31:14,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:14,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:14,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1564960645, now seen corresponding path program 2 times [2025-02-08 05:31:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:14,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655313762] [2025-02-08 05:31:14,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:14,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-02-08 05:31:14,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 125 statements. [2025-02-08 05:31:14,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:14,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-08 05:31:15,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:15,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655313762] [2025-02-08 05:31:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655313762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:15,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322665564] [2025-02-08 05:31:15,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:15,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:15,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:15,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:15,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:15,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 223 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:15,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:15,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:15,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:15,780 INFO L124 PetriNetUnfolderBase]: 505/2412 cut-off events. [2025-02-08 05:31:15,780 INFO L125 PetriNetUnfolderBase]: For 415/445 co-relation queries the response was YES. [2025-02-08 05:31:15,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 2412 events. 505/2412 cut-off events. For 415/445 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 17741 event pairs, 194 based on Foata normal form. 5/2276 useless extension candidates. Maximal degree in co-relation 3909. Up to 824 conditions per place. [2025-02-08 05:31:15,792 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 61 selfloop transitions, 46 changer transitions 0/284 dead transitions. [2025-02-08 05:31:15,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 284 transitions, 1086 flow [2025-02-08 05:31:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1001 transitions. [2025-02-08 05:31:15,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-02-08 05:31:15,795 INFO L175 Difference]: Start difference. First operand has 230 places, 223 transitions, 708 flow. Second operand 6 states and 1001 transitions. [2025-02-08 05:31:15,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 284 transitions, 1086 flow [2025-02-08 05:31:15,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 284 transitions, 1062 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 05:31:15,804 INFO L231 Difference]: Finished difference. Result has 234 places, 268 transitions, 1038 flow [2025-02-08 05:31:15,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1038, PETRI_PLACES=234, PETRI_TRANSITIONS=268} [2025-02-08 05:31:15,805 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 52 predicate places. [2025-02-08 05:31:15,805 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 268 transitions, 1038 flow [2025-02-08 05:31:15,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:15,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:15,806 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:15,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:31:15,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:15,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1215913403, now seen corresponding path program 1 times [2025-02-08 05:31:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913971414] [2025-02-08 05:31:15,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:15,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-08 05:31:15,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-08 05:31:15,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:15,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:16,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913971414] [2025-02-08 05:31:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913971414] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434581752] [2025-02-08 05:31:16,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:16,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:16,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:16,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:16,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 05:31:16,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-08 05:31:16,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-08 05:31:16,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:16,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:16,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 05:31:16,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:16,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:31:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:31:16,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434581752] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:31:16,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:31:16,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-08 05:31:16,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995617915] [2025-02-08 05:31:16,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:31:16,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 05:31:16,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:16,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 05:31:16,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-08 05:31:16,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-02-08 05:31:16,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 268 transitions, 1038 flow. Second operand has 23 states, 23 states have (on average 168.08695652173913) internal successors, (3866), 23 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:16,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:16,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-02-08 05:31:16,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:17,269 INFO L124 PetriNetUnfolderBase]: 264/1738 cut-off events. [2025-02-08 05:31:17,270 INFO L125 PetriNetUnfolderBase]: For 589/618 co-relation queries the response was YES. [2025-02-08 05:31:17,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 1738 events. 264/1738 cut-off events. For 589/618 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 11582 event pairs, 40 based on Foata normal form. 13/1667 useless extension candidates. Maximal degree in co-relation 2886. Up to 204 conditions per place. [2025-02-08 05:31:17,280 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 23 selfloop transitions, 30 changer transitions 0/285 dead transitions. [2025-02-08 05:31:17,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 285 transitions, 1266 flow [2025-02-08 05:31:17,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 05:31:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-08 05:31:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5036 transitions. [2025-02-08 05:31:17,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9223443223443224 [2025-02-08 05:31:17,290 INFO L175 Difference]: Start difference. First operand has 234 places, 268 transitions, 1038 flow. Second operand 30 states and 5036 transitions. [2025-02-08 05:31:17,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 285 transitions, 1266 flow [2025-02-08 05:31:17,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 285 transitions, 1266 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:17,301 INFO L231 Difference]: Finished difference. Result has 267 places, 278 transitions, 1190 flow [2025-02-08 05:31:17,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1190, PETRI_PLACES=267, PETRI_TRANSITIONS=278} [2025-02-08 05:31:17,302 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 85 predicate places. [2025-02-08 05:31:17,302 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 278 transitions, 1190 flow [2025-02-08 05:31:17,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.08695652173913) internal successors, (3866), 23 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:17,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:17,304 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:17,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 05:31:17,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-08 05:31:17,505 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:17,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:17,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1486487265, now seen corresponding path program 2 times [2025-02-08 05:31:17,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:17,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027669569] [2025-02-08 05:31:17,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:17,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:17,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-02-08 05:31:17,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 148 statements. [2025-02-08 05:31:17,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:17,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:17,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:17,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027669569] [2025-02-08 05:31:17,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027669569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:17,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:17,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:17,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844108650] [2025-02-08 05:31:17,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:17,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:17,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:17,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:17,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:18,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2025-02-08 05:31:18,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 278 transitions, 1190 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:18,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:18,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2025-02-08 05:31:18,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:18,655 INFO L124 PetriNetUnfolderBase]: 949/3309 cut-off events. [2025-02-08 05:31:18,655 INFO L125 PetriNetUnfolderBase]: For 2070/2165 co-relation queries the response was YES. [2025-02-08 05:31:18,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7539 conditions, 3309 events. 949/3309 cut-off events. For 2070/2165 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23775 event pairs, 303 based on Foata normal form. 20/3172 useless extension candidates. Maximal degree in co-relation 7261. Up to 1634 conditions per place. [2025-02-08 05:31:18,677 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 102 selfloop transitions, 57 changer transitions 0/333 dead transitions. [2025-02-08 05:31:18,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 333 transitions, 1752 flow [2025-02-08 05:31:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 943 transitions. [2025-02-08 05:31:18,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635531135531136 [2025-02-08 05:31:18,680 INFO L175 Difference]: Start difference. First operand has 267 places, 278 transitions, 1190 flow. Second operand 6 states and 943 transitions. [2025-02-08 05:31:18,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 333 transitions, 1752 flow [2025-02-08 05:31:18,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 333 transitions, 1706 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-08 05:31:18,696 INFO L231 Difference]: Finished difference. Result has 259 places, 325 transitions, 1642 flow [2025-02-08 05:31:18,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1642, PETRI_PLACES=259, PETRI_TRANSITIONS=325} [2025-02-08 05:31:18,697 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 77 predicate places. [2025-02-08 05:31:18,697 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 325 transitions, 1642 flow [2025-02-08 05:31:18,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:18,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:18,698 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:18,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:31:18,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:18,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash 472970467, now seen corresponding path program 1 times [2025-02-08 05:31:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180674255] [2025-02-08 05:31:18,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:18,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 05:31:18,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 05:31:18,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:18,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180674255] [2025-02-08 05:31:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180674255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:19,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:19,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:31:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681832053] [2025-02-08 05:31:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:19,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:31:19,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:19,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:31:19,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:31:19,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2025-02-08 05:31:19,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 325 transitions, 1642 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:19,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:19,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2025-02-08 05:31:19,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:20,184 INFO L124 PetriNetUnfolderBase]: 1319/4555 cut-off events. [2025-02-08 05:31:20,185 INFO L125 PetriNetUnfolderBase]: For 4939/5070 co-relation queries the response was YES. [2025-02-08 05:31:20,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11634 conditions, 4555 events. 1319/4555 cut-off events. For 4939/5070 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 35720 event pairs, 341 based on Foata normal form. 40/4406 useless extension candidates. Maximal degree in co-relation 11373. Up to 2190 conditions per place. [2025-02-08 05:31:20,220 INFO L140 encePairwiseOnDemand]: 159/182 looper letters, 143 selfloop transitions, 103 changer transitions 4/426 dead transitions. [2025-02-08 05:31:20,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 426 transitions, 2608 flow [2025-02-08 05:31:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:31:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:31:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 983 transitions. [2025-02-08 05:31:20,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9001831501831502 [2025-02-08 05:31:20,223 INFO L175 Difference]: Start difference. First operand has 259 places, 325 transitions, 1642 flow. Second operand 6 states and 983 transitions. [2025-02-08 05:31:20,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 426 transitions, 2608 flow [2025-02-08 05:31:20,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 426 transitions, 2544 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:20,252 INFO L231 Difference]: Finished difference. Result has 269 places, 410 transitions, 2494 flow [2025-02-08 05:31:20,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2494, PETRI_PLACES=269, PETRI_TRANSITIONS=410} [2025-02-08 05:31:20,254 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 87 predicate places. [2025-02-08 05:31:20,254 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 410 transitions, 2494 flow [2025-02-08 05:31:20,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:20,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:20,255 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:20,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:31:20,256 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:20,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash 437781765, now seen corresponding path program 1 times [2025-02-08 05:31:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:20,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602778766] [2025-02-08 05:31:20,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:31:20,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:20,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 05:31:20,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:20,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:20,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:20,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:20,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602778766] [2025-02-08 05:31:20,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602778766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:20,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:20,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:20,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828791930] [2025-02-08 05:31:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:20,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:20,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:20,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:20,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:22,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:22,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 410 transitions, 2494 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:22,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:22,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:22,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:23,151 INFO L124 PetriNetUnfolderBase]: 1229/4915 cut-off events. [2025-02-08 05:31:23,152 INFO L125 PetriNetUnfolderBase]: For 6169/6308 co-relation queries the response was YES. [2025-02-08 05:31:23,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13115 conditions, 4915 events. 1229/4915 cut-off events. For 6169/6308 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 41567 event pairs, 180 based on Foata normal form. 37/4875 useless extension candidates. Maximal degree in co-relation 12837. Up to 712 conditions per place. [2025-02-08 05:31:23,196 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 73 selfloop transitions, 15 changer transitions 0/468 dead transitions. [2025-02-08 05:31:23,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 468 transitions, 2786 flow [2025-02-08 05:31:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1467 transitions. [2025-02-08 05:31:23,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8956043956043956 [2025-02-08 05:31:23,200 INFO L175 Difference]: Start difference. First operand has 269 places, 410 transitions, 2494 flow. Second operand 9 states and 1467 transitions. [2025-02-08 05:31:23,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 468 transitions, 2786 flow [2025-02-08 05:31:23,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 468 transitions, 2672 flow, removed 57 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:23,251 INFO L231 Difference]: Finished difference. Result has 284 places, 424 transitions, 2492 flow [2025-02-08 05:31:23,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2380, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2492, PETRI_PLACES=284, PETRI_TRANSITIONS=424} [2025-02-08 05:31:23,252 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 102 predicate places. [2025-02-08 05:31:23,252 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 424 transitions, 2492 flow [2025-02-08 05:31:23,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:23,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:23,253 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:23,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:31:23,254 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:23,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:23,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1398517849, now seen corresponding path program 2 times [2025-02-08 05:31:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427373470] [2025-02-08 05:31:23,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:23,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-02-08 05:31:23,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:31:23,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:23,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:23,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:23,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427373470] [2025-02-08 05:31:23,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427373470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:23,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:23,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:23,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111687222] [2025-02-08 05:31:23,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:23,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:23,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:23,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:23,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:25,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:25,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 424 transitions, 2492 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:25,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:25,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:25,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:26,610 INFO L124 PetriNetUnfolderBase]: 2479/9316 cut-off events. [2025-02-08 05:31:26,611 INFO L125 PetriNetUnfolderBase]: For 12674/12974 co-relation queries the response was YES. [2025-02-08 05:31:26,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26480 conditions, 9316 events. 2479/9316 cut-off events. For 12674/12974 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 88705 event pairs, 325 based on Foata normal form. 99/9273 useless extension candidates. Maximal degree in co-relation 26194. Up to 1468 conditions per place. [2025-02-08 05:31:26,667 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 119 selfloop transitions, 20 changer transitions 4/523 dead transitions. [2025-02-08 05:31:26,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 523 transitions, 3210 flow [2025-02-08 05:31:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1475 transitions. [2025-02-08 05:31:26,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9004884004884005 [2025-02-08 05:31:26,672 INFO L175 Difference]: Start difference. First operand has 284 places, 424 transitions, 2492 flow. Second operand 9 states and 1475 transitions. [2025-02-08 05:31:26,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 523 transitions, 3210 flow [2025-02-08 05:31:26,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 523 transitions, 3200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:31:26,753 INFO L231 Difference]: Finished difference. Result has 298 places, 441 transitions, 2671 flow [2025-02-08 05:31:26,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2490, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2671, PETRI_PLACES=298, PETRI_TRANSITIONS=441} [2025-02-08 05:31:26,754 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 116 predicate places. [2025-02-08 05:31:26,754 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 441 transitions, 2671 flow [2025-02-08 05:31:26,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:26,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:26,755 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:26,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:31:26,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:26,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash -831907079, now seen corresponding path program 3 times [2025-02-08 05:31:26,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:26,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919690611] [2025-02-08 05:31:26,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:31:26,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:26,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:26,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:31:26,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:31:26,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:27,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:27,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919690611] [2025-02-08 05:31:27,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919690611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:27,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:27,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:27,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409296121] [2025-02-08 05:31:27,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:27,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:27,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:27,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:27,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:28,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:28,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 441 transitions, 2671 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:28,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:28,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:28,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:30,629 INFO L124 PetriNetUnfolderBase]: 2778/10527 cut-off events. [2025-02-08 05:31:30,629 INFO L125 PetriNetUnfolderBase]: For 16432/16884 co-relation queries the response was YES. [2025-02-08 05:31:30,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31099 conditions, 10527 events. 2778/10527 cut-off events. For 16432/16884 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 101869 event pairs, 352 based on Foata normal form. 106/10467 useless extension candidates. Maximal degree in co-relation 30805. Up to 1567 conditions per place. [2025-02-08 05:31:30,691 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 123 selfloop transitions, 22 changer transitions 0/525 dead transitions. [2025-02-08 05:31:30,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 525 transitions, 3459 flow [2025-02-08 05:31:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1472 transitions. [2025-02-08 05:31:30,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8986568986568987 [2025-02-08 05:31:30,695 INFO L175 Difference]: Start difference. First operand has 298 places, 441 transitions, 2671 flow. Second operand 9 states and 1472 transitions. [2025-02-08 05:31:30,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 525 transitions, 3459 flow [2025-02-08 05:31:30,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 525 transitions, 3421 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:30,793 INFO L231 Difference]: Finished difference. Result has 311 places, 453 transitions, 2840 flow [2025-02-08 05:31:30,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2840, PETRI_PLACES=311, PETRI_TRANSITIONS=453} [2025-02-08 05:31:30,795 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 129 predicate places. [2025-02-08 05:31:30,796 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 453 transitions, 2840 flow [2025-02-08 05:31:30,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:30,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:30,797 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:30,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:31:30,798 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:30,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1532316581, now seen corresponding path program 4 times [2025-02-08 05:31:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420134943] [2025-02-08 05:31:30,799 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:31:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:30,823 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-02-08 05:31:30,860 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:30,860 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:31:30,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:31,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:31,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420134943] [2025-02-08 05:31:31,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420134943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:31:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550319537] [2025-02-08 05:31:31,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:31,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:31,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:31,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:31:33,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:33,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 453 transitions, 2840 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:33,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:33,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:33,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:34,955 INFO L124 PetriNetUnfolderBase]: 3073/11395 cut-off events. [2025-02-08 05:31:34,956 INFO L125 PetriNetUnfolderBase]: For 20334/20790 co-relation queries the response was YES. [2025-02-08 05:31:34,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34824 conditions, 11395 events. 3073/11395 cut-off events. For 20334/20790 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 111168 event pairs, 346 based on Foata normal form. 119/11359 useless extension candidates. Maximal degree in co-relation 34524. Up to 1851 conditions per place. [2025-02-08 05:31:35,039 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 137 selfloop transitions, 28 changer transitions 4/549 dead transitions. [2025-02-08 05:31:35,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 549 transitions, 3825 flow [2025-02-08 05:31:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:31:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:31:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1631 transitions. [2025-02-08 05:31:35,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8961538461538462 [2025-02-08 05:31:35,042 INFO L175 Difference]: Start difference. First operand has 311 places, 453 transitions, 2840 flow. Second operand 10 states and 1631 transitions. [2025-02-08 05:31:35,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 549 transitions, 3825 flow [2025-02-08 05:31:35,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 549 transitions, 3746 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-08 05:31:35,171 INFO L231 Difference]: Finished difference. Result has 322 places, 465 transitions, 3021 flow [2025-02-08 05:31:35,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2814, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3021, PETRI_PLACES=322, PETRI_TRANSITIONS=465} [2025-02-08 05:31:35,173 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 140 predicate places. [2025-02-08 05:31:35,173 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 465 transitions, 3021 flow [2025-02-08 05:31:35,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:35,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:35,175 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:35,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:31:35,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:35,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1651051123, now seen corresponding path program 5 times [2025-02-08 05:31:35,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:35,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137406722] [2025-02-08 05:31:35,177 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:31:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:35,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:35,223 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:35,224 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:31:35,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-02-08 05:31:36,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137406722] [2025-02-08 05:31:36,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137406722] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:31:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424440659] [2025-02-08 05:31:36,053 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:31:36,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:31:36,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:31:36,055 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:31:36,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 05:31:36,135 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:36,216 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:36,216 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:31:36,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:36,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 05:31:36,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:31:36,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 05:31:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:36,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:31:36,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424440659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:36,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:31:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-02-08 05:31:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770980092] [2025-02-08 05:31:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:36,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:36,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:36,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:31:37,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:37,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 465 transitions, 3021 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:37,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:37,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:37,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:39,916 INFO L124 PetriNetUnfolderBase]: 3406/12720 cut-off events. [2025-02-08 05:31:39,917 INFO L125 PetriNetUnfolderBase]: For 25378/25972 co-relation queries the response was YES. [2025-02-08 05:31:39,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39483 conditions, 12720 events. 3406/12720 cut-off events. For 25378/25972 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 126970 event pairs, 382 based on Foata normal form. 112/12645 useless extension candidates. Maximal degree in co-relation 39177. Up to 1959 conditions per place. [2025-02-08 05:31:39,995 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 136 selfloop transitions, 30 changer transitions 0/546 dead transitions. [2025-02-08 05:31:39,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 546 transitions, 4004 flow [2025-02-08 05:31:39,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:31:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:31:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1628 transitions. [2025-02-08 05:31:39,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8945054945054945 [2025-02-08 05:31:39,997 INFO L175 Difference]: Start difference. First operand has 322 places, 465 transitions, 3021 flow. Second operand 10 states and 1628 transitions. [2025-02-08 05:31:39,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 546 transitions, 4004 flow [2025-02-08 05:31:40,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 546 transitions, 3911 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-02-08 05:31:40,112 INFO L231 Difference]: Finished difference. Result has 333 places, 480 transitions, 3259 flow [2025-02-08 05:31:40,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2978, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3259, PETRI_PLACES=333, PETRI_TRANSITIONS=480} [2025-02-08 05:31:40,113 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 151 predicate places. [2025-02-08 05:31:40,113 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 480 transitions, 3259 flow [2025-02-08 05:31:40,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:40,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:40,114 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:40,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 05:31:40,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 05:31:40,318 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:40,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash 612747393, now seen corresponding path program 6 times [2025-02-08 05:31:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654703146] [2025-02-08 05:31:40,319 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:31:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:40,334 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:40,344 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:31:40,344 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 05:31:40,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:40,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:40,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654703146] [2025-02-08 05:31:40,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654703146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:40,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:40,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:40,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564314294] [2025-02-08 05:31:40,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:40,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:40,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:40,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:40,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:41,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:41,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 480 transitions, 3259 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:41,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:41,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:41,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:43,984 INFO L124 PetriNetUnfolderBase]: 3725/13728 cut-off events. [2025-02-08 05:31:43,984 INFO L125 PetriNetUnfolderBase]: For 31646/32260 co-relation queries the response was YES. [2025-02-08 05:31:44,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43944 conditions, 13728 events. 3725/13728 cut-off events. For 31646/32260 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 138954 event pairs, 386 based on Foata normal form. 120/13668 useless extension candidates. Maximal degree in co-relation 43632. Up to 2232 conditions per place. [2025-02-08 05:31:44,088 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 154 selfloop transitions, 34 changer transitions 2/570 dead transitions. [2025-02-08 05:31:44,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 570 transitions, 4410 flow [2025-02-08 05:31:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2025-02-08 05:31:44,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-02-08 05:31:44,090 INFO L175 Difference]: Start difference. First operand has 333 places, 480 transitions, 3259 flow. Second operand 9 states and 1479 transitions. [2025-02-08 05:31:44,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 570 transitions, 4410 flow [2025-02-08 05:31:44,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 570 transitions, 4312 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-02-08 05:31:44,234 INFO L231 Difference]: Finished difference. Result has 344 places, 495 transitions, 3504 flow [2025-02-08 05:31:44,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3198, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3504, PETRI_PLACES=344, PETRI_TRANSITIONS=495} [2025-02-08 05:31:44,235 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 162 predicate places. [2025-02-08 05:31:44,235 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 495 transitions, 3504 flow [2025-02-08 05:31:44,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:44,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:44,236 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:44,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:31:44,236 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:44,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2003261937, now seen corresponding path program 7 times [2025-02-08 05:31:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347969669] [2025-02-08 05:31:44,238 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 05:31:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:44,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 05:31:44,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:44,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:31:44,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:44,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:44,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347969669] [2025-02-08 05:31:44,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347969669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:44,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:44,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:44,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120209492] [2025-02-08 05:31:44,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:44,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:44,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:44,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:44,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:45,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:45,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 495 transitions, 3504 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:45,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:45,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:45,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:48,297 INFO L124 PetriNetUnfolderBase]: 4068/15087 cut-off events. [2025-02-08 05:31:48,297 INFO L125 PetriNetUnfolderBase]: For 40062/40723 co-relation queries the response was YES. [2025-02-08 05:31:48,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49325 conditions, 15087 events. 4068/15087 cut-off events. For 40062/40723 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 155876 event pairs, 478 based on Foata normal form. 107/14981 useless extension candidates. Maximal degree in co-relation 49008. Up to 2363 conditions per place. [2025-02-08 05:31:48,399 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 150 selfloop transitions, 36 changer transitions 0/566 dead transitions. [2025-02-08 05:31:48,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 566 transitions, 4606 flow [2025-02-08 05:31:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1477 transitions. [2025-02-08 05:31:48,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017094017094017 [2025-02-08 05:31:48,401 INFO L175 Difference]: Start difference. First operand has 344 places, 495 transitions, 3504 flow. Second operand 9 states and 1477 transitions. [2025-02-08 05:31:48,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 566 transitions, 4606 flow [2025-02-08 05:31:48,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 566 transitions, 4506 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-02-08 05:31:48,559 INFO L231 Difference]: Finished difference. Result has 357 places, 514 transitions, 3855 flow [2025-02-08 05:31:48,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3855, PETRI_PLACES=357, PETRI_TRANSITIONS=514} [2025-02-08 05:31:48,560 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 175 predicate places. [2025-02-08 05:31:48,560 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 514 transitions, 3855 flow [2025-02-08 05:31:48,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:48,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:48,560 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:48,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:31:48,561 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:48,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash 827447523, now seen corresponding path program 8 times [2025-02-08 05:31:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509979006] [2025-02-08 05:31:48,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:31:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:48,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-02-08 05:31:48,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:31:48,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:31:48,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:48,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:48,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509979006] [2025-02-08 05:31:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509979006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:48,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450483720] [2025-02-08 05:31:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:48,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:48,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:48,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:49,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:49,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 514 transitions, 3855 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:49,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:49,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:49,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:52,697 INFO L124 PetriNetUnfolderBase]: 4671/16951 cut-off events. [2025-02-08 05:31:52,697 INFO L125 PetriNetUnfolderBase]: For 51154/52038 co-relation queries the response was YES. [2025-02-08 05:31:52,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57058 conditions, 16951 events. 4671/16951 cut-off events. For 51154/52038 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 179891 event pairs, 469 based on Foata normal form. 137/16875 useless extension candidates. Maximal degree in co-relation 56734. Up to 2778 conditions per place. [2025-02-08 05:31:52,835 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 173 selfloop transitions, 45 changer transitions 0/598 dead transitions. [2025-02-08 05:31:52,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 598 transitions, 5172 flow [2025-02-08 05:31:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1481 transitions. [2025-02-08 05:31:52,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9041514041514042 [2025-02-08 05:31:52,837 INFO L175 Difference]: Start difference. First operand has 357 places, 514 transitions, 3855 flow. Second operand 9 states and 1481 transitions. [2025-02-08 05:31:52,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 598 transitions, 5172 flow [2025-02-08 05:31:53,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 598 transitions, 5068 flow, removed 52 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:53,036 INFO L231 Difference]: Finished difference. Result has 372 places, 532 transitions, 4209 flow [2025-02-08 05:31:53,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3751, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4209, PETRI_PLACES=372, PETRI_TRANSITIONS=532} [2025-02-08 05:31:53,037 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 190 predicate places. [2025-02-08 05:31:53,037 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 532 transitions, 4209 flow [2025-02-08 05:31:53,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:53,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:53,037 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:53,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:31:53,038 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:53,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:53,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1766678525, now seen corresponding path program 9 times [2025-02-08 05:31:53,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:53,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486385284] [2025-02-08 05:31:53,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:31:53,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:53,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:31:53,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:31:53,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:31:53,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:53,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:53,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486385284] [2025-02-08 05:31:53,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486385284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:53,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:53,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:31:53,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90687964] [2025-02-08 05:31:53,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:53,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:31:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:53,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:31:53,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:31:54,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:54,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 532 transitions, 4209 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:54,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:54,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:54,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:31:57,729 INFO L124 PetriNetUnfolderBase]: 4663/17065 cut-off events. [2025-02-08 05:31:57,729 INFO L125 PetriNetUnfolderBase]: For 56849/57751 co-relation queries the response was YES. [2025-02-08 05:31:57,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58128 conditions, 17065 events. 4663/17065 cut-off events. For 56849/57751 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 181771 event pairs, 445 based on Foata normal form. 223/17085 useless extension candidates. Maximal degree in co-relation 57796. Up to 2699 conditions per place. [2025-02-08 05:31:57,838 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 185 selfloop transitions, 58 changer transitions 0/623 dead transitions. [2025-02-08 05:31:57,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 623 transitions, 5535 flow [2025-02-08 05:31:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:31:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:31:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1470 transitions. [2025-02-08 05:31:57,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-02-08 05:31:57,840 INFO L175 Difference]: Start difference. First operand has 372 places, 532 transitions, 4209 flow. Second operand 9 states and 1470 transitions. [2025-02-08 05:31:57,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 623 transitions, 5535 flow [2025-02-08 05:31:58,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 623 transitions, 5447 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-02-08 05:31:58,049 INFO L231 Difference]: Finished difference. Result has 384 places, 544 transitions, 4449 flow [2025-02-08 05:31:58,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4123, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4449, PETRI_PLACES=384, PETRI_TRANSITIONS=544} [2025-02-08 05:31:58,050 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 202 predicate places. [2025-02-08 05:31:58,050 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 544 transitions, 4449 flow [2025-02-08 05:31:58,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:58,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:31:58,051 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:31:58,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:31:58,051 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:31:58,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:31:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash 701480627, now seen corresponding path program 10 times [2025-02-08 05:31:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:31:58,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103682903] [2025-02-08 05:31:58,052 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:31:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:31:58,063 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-02-08 05:31:58,076 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:31:58,076 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:31:58,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:31:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:31:58,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:31:58,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103682903] [2025-02-08 05:31:58,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103682903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:31:58,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:31:58,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:31:58,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787838855] [2025-02-08 05:31:58,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:31:58,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:31:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:31:58,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:31:58,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:31:59,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:31:59,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 544 transitions, 4449 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:31:59,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:31:59,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:31:59,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:02,494 INFO L124 PetriNetUnfolderBase]: 4388/16276 cut-off events. [2025-02-08 05:32:02,494 INFO L125 PetriNetUnfolderBase]: For 58784/59687 co-relation queries the response was YES. [2025-02-08 05:32:02,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56085 conditions, 16276 events. 4388/16276 cut-off events. For 58784/59687 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 171676 event pairs, 426 based on Foata normal form. 205/16278 useless extension candidates. Maximal degree in co-relation 55748. Up to 2535 conditions per place. [2025-02-08 05:32:02,647 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 185 selfloop transitions, 55 changer transitions 0/620 dead transitions. [2025-02-08 05:32:02,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 620 transitions, 5663 flow [2025-02-08 05:32:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:32:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:32:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1621 transitions. [2025-02-08 05:32:02,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8906593406593407 [2025-02-08 05:32:02,649 INFO L175 Difference]: Start difference. First operand has 384 places, 544 transitions, 4449 flow. Second operand 10 states and 1621 transitions. [2025-02-08 05:32:02,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 620 transitions, 5663 flow [2025-02-08 05:32:02,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 620 transitions, 5481 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-02-08 05:32:02,903 INFO L231 Difference]: Finished difference. Result has 392 places, 547 transitions, 4483 flow [2025-02-08 05:32:02,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4279, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4483, PETRI_PLACES=392, PETRI_TRANSITIONS=547} [2025-02-08 05:32:02,903 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 210 predicate places. [2025-02-08 05:32:02,903 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 547 transitions, 4483 flow [2025-02-08 05:32:02,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:02,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:02,904 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:02,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:32:02,904 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:32:02,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:02,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1391794329, now seen corresponding path program 11 times [2025-02-08 05:32:02,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:02,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380894360] [2025-02-08 05:32:02,905 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:32:02,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:02,920 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:32:02,937 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:32:02,937 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:32:02,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-02-08 05:32:03,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380894360] [2025-02-08 05:32:03,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380894360] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721562694] [2025-02-08 05:32:03,538 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:32:03,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:03,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:03,540 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:32:03,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 05:32:03,759 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:32:03,818 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:32:03,819 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:32:03,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:03,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 05:32:03,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:04,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 05:32:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:04,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:32:04,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721562694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:04,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:32:04,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-02-08 05:32:04,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827624638] [2025-02-08 05:32:04,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:04,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:32:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:04,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:32:04,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:32:04,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:32:04,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 547 transitions, 4483 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:04,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:04,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:32:04,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:07,794 INFO L124 PetriNetUnfolderBase]: 4390/16303 cut-off events. [2025-02-08 05:32:07,794 INFO L125 PetriNetUnfolderBase]: For 56526/57306 co-relation queries the response was YES. [2025-02-08 05:32:07,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56006 conditions, 16303 events. 4390/16303 cut-off events. For 56526/57306 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 171898 event pairs, 450 based on Foata normal form. 175/16273 useless extension candidates. Maximal degree in co-relation 55665. Up to 2566 conditions per place. [2025-02-08 05:32:07,936 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 179 selfloop transitions, 61 changer transitions 0/620 dead transitions. [2025-02-08 05:32:07,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 620 transitions, 5647 flow [2025-02-08 05:32:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:32:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:32:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1624 transitions. [2025-02-08 05:32:07,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2025-02-08 05:32:07,938 INFO L175 Difference]: Start difference. First operand has 392 places, 547 transitions, 4483 flow. Second operand 10 states and 1624 transitions. [2025-02-08 05:32:07,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 620 transitions, 5647 flow [2025-02-08 05:32:08,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 620 transitions, 5529 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 05:32:08,163 INFO L231 Difference]: Finished difference. Result has 400 places, 558 transitions, 4735 flow [2025-02-08 05:32:08,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4383, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4735, PETRI_PLACES=400, PETRI_TRANSITIONS=558} [2025-02-08 05:32:08,164 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 218 predicate places. [2025-02-08 05:32:08,164 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 558 transitions, 4735 flow [2025-02-08 05:32:08,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:08,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:08,165 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:08,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 05:32:08,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:08,366 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:32:08,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash -899460179, now seen corresponding path program 12 times [2025-02-08 05:32:08,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:08,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830763581] [2025-02-08 05:32:08,367 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:32:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:08,378 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-02-08 05:32:08,383 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:32:08,383 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 05:32:08,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:08,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:08,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830763581] [2025-02-08 05:32:08,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830763581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:08,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:08,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:32:08,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230572817] [2025-02-08 05:32:08,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:08,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:32:08,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:08,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:32:08,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:32:09,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:32:09,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 558 transitions, 4735 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:09,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:09,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:32:09,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:13,204 INFO L124 PetriNetUnfolderBase]: 4679/17288 cut-off events. [2025-02-08 05:32:13,205 INFO L125 PetriNetUnfolderBase]: For 63812/64634 co-relation queries the response was YES. [2025-02-08 05:32:13,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59966 conditions, 17288 events. 4679/17288 cut-off events. For 63812/64634 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 184670 event pairs, 475 based on Foata normal form. 163/17232 useless extension candidates. Maximal degree in co-relation 59620. Up to 2741 conditions per place. [2025-02-08 05:32:13,368 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 203 selfloop transitions, 49 changer transitions 0/632 dead transitions. [2025-02-08 05:32:13,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 632 transitions, 6071 flow [2025-02-08 05:32:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:32:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:32:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2025-02-08 05:32:13,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-02-08 05:32:13,370 INFO L175 Difference]: Start difference. First operand has 400 places, 558 transitions, 4735 flow. Second operand 9 states and 1479 transitions. [2025-02-08 05:32:13,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 632 transitions, 6071 flow [2025-02-08 05:32:13,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 632 transitions, 5865 flow, removed 73 selfloop flow, removed 4 redundant places. [2025-02-08 05:32:13,636 INFO L231 Difference]: Finished difference. Result has 408 places, 568 transitions, 4915 flow [2025-02-08 05:32:13,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4627, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4915, PETRI_PLACES=408, PETRI_TRANSITIONS=568} [2025-02-08 05:32:13,637 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 226 predicate places. [2025-02-08 05:32:13,637 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 568 transitions, 4915 flow [2025-02-08 05:32:13,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:13,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:13,638 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:13,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:32:13,638 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:32:13,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash 809050863, now seen corresponding path program 13 times [2025-02-08 05:32:13,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:13,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147483004] [2025-02-08 05:32:13,639 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 05:32:13,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:13,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 05:32:13,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:32:13,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:13,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:13,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:13,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147483004] [2025-02-08 05:32:13,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147483004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:13,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:13,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:32:13,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408250358] [2025-02-08 05:32:13,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:13,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:32:13,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:13,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:32:13,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:32:14,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:32:14,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 568 transitions, 4915 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:14,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:14,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:32:14,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:17,873 INFO L124 PetriNetUnfolderBase]: 4685/17399 cut-off events. [2025-02-08 05:32:17,873 INFO L125 PetriNetUnfolderBase]: For 62995/63828 co-relation queries the response was YES. [2025-02-08 05:32:17,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60279 conditions, 17399 events. 4685/17399 cut-off events. For 62995/63828 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 186544 event pairs, 453 based on Foata normal form. 184/17371 useless extension candidates. Maximal degree in co-relation 59930. Up to 2755 conditions per place. [2025-02-08 05:32:18,025 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 192 selfloop transitions, 66 changer transitions 0/638 dead transitions. [2025-02-08 05:32:18,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 638 transitions, 6128 flow [2025-02-08 05:32:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:32:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:32:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1473 transitions. [2025-02-08 05:32:18,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8992673992673993 [2025-02-08 05:32:18,027 INFO L175 Difference]: Start difference. First operand has 408 places, 568 transitions, 4915 flow. Second operand 9 states and 1473 transitions. [2025-02-08 05:32:18,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 638 transitions, 6128 flow [2025-02-08 05:32:18,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 638 transitions, 6031 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-02-08 05:32:18,464 INFO L231 Difference]: Finished difference. Result has 415 places, 577 transitions, 5143 flow [2025-02-08 05:32:18,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4827, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5143, PETRI_PLACES=415, PETRI_TRANSITIONS=577} [2025-02-08 05:32:18,465 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 233 predicate places. [2025-02-08 05:32:18,465 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 577 transitions, 5143 flow [2025-02-08 05:32:18,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:18,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:18,466 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:18,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:32:18,466 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:32:18,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash -858546925, now seen corresponding path program 14 times [2025-02-08 05:32:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:18,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955390457] [2025-02-08 05:32:18,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:32:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:18,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-02-08 05:32:18,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-08 05:32:18,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:32:18,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:18,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:18,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955390457] [2025-02-08 05:32:18,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955390457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:18,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:32:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562865118] [2025-02-08 05:32:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:18,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:32:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:18,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:32:18,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:32:19,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-08 05:32:19,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 577 transitions, 5143 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:19,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:19,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-08 05:32:19,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand