./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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_23-idxsense_nr.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 9205365dcda04af07212d180b1c6367c5de79b6e0d2e09ec11b949fed58626f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:21:03,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:21:03,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:21:03,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:21:03,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:21:03,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:21:03,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:21:03,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:21:03,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:21:03,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:21:03,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:21:03,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:21:03,231 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:21:03,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:21:03,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:21:03,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:21:03,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:21:03,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:21:03,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:21:03,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:21:03,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:21:03,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:21:03,232 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:21:03,232 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:21:03,233 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:21:03,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:21:03,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:21:03,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:21:03,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:21:03,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:21:03,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:21:03,234 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 -> 9205365dcda04af07212d180b1c6367c5de79b6e0d2e09ec11b949fed58626f5 [2025-02-06 09:21:03,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:21:03,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:21:03,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:21:03,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:21:03,479 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:21:03,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i [2025-02-06 09:21:04,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ff6e84a2/b6b47adab06943939c6c0d9cca58fdf7/FLAGd1cac8790 [2025-02-06 09:21:04,898 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:21:04,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i [2025-02-06 09:21:04,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ff6e84a2/b6b47adab06943939c6c0d9cca58fdf7/FLAGd1cac8790 [2025-02-06 09:21:05,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ff6e84a2/b6b47adab06943939c6c0d9cca58fdf7 [2025-02-06 09:21:05,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:21:05,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:21:05,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:21:05,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:21:05,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:21:05,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f8cb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05, skipping insertion in model container [2025-02-06 09:21:05,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:21:05,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:21:05,457 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:21:05,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:21:05,514 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:21:05,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05 WrapperNode [2025-02-06 09:21:05,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:21:05,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:21:05,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:21:05,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:21:05,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,542 INFO L138 Inliner]: procedures = 162, calls = 77, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2025-02-06 09:21:05,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:21:05,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:21:05,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:21:05,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:21:05,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:21:05,574 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:21:05,574 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:21:05,574 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:21:05,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (1/1) ... [2025-02-06 09:21:05,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:21:05,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:21:05,601 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-06 09:21:05,602 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-06 09:21:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:21:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:21:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:21:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:21:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:21:05,617 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:21:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:21:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:21:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:21:05,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:21:05,618 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:21:05,688 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:21:05,690 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:21:05,958 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:21:05,959 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:21:05,991 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:21:05,992 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:21:05,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:21:05 BoogieIcfgContainer [2025-02-06 09:21:05,993 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:21:05,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:21:05,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:21:05,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:21:05,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:21:05" (1/3) ... [2025-02-06 09:21:05,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bcdf73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:21:05, skipping insertion in model container [2025-02-06 09:21:05,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:21:05" (2/3) ... [2025-02-06 09:21:06,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bcdf73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:21:06, skipping insertion in model container [2025-02-06 09:21:06,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:21:05" (3/3) ... [2025-02-06 09:21:06,001 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_23-idxsense_nr.i [2025-02-06 09:21:06,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:21:06,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_23-idxsense_nr.i that has 2 procedures, 160 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-02-06 09:21:06,014 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:21:06,077 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:21:06,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 160 transitions, 324 flow [2025-02-06 09:21:06,168 INFO L124 PetriNetUnfolderBase]: 1/159 cut-off events. [2025-02-06 09:21:06,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:21:06,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 159 events. 1/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2025-02-06 09:21:06,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 160 transitions, 324 flow [2025-02-06 09:21:06,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 159 transitions, 321 flow [2025-02-06 09:21:06,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:21:06,198 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;@1909a093, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:21:06,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 09:21:06,229 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:21:06,230 INFO L124 PetriNetUnfolderBase]: 1/98 cut-off events. [2025-02-06 09:21:06,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:21:06,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:06,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:06,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:06,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash 971379206, now seen corresponding path program 1 times [2025-02-06 09:21:06,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:06,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695310451] [2025-02-06 09:21:06,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:06,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 09:21:06,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 09:21:06,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:06,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:06,554 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-06 09:21:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695310451] [2025-02-06 09:21:06,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695310451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:21:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981711821] [2025-02-06 09:21:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:06,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:21:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:06,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:21:06,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:21:06,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 160 [2025-02-06 09:21:06,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 159 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-06 09:21:06,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:06,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 160 [2025-02-06 09:21:06,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:06,675 INFO L124 PetriNetUnfolderBase]: 11/298 cut-off events. [2025-02-06 09:21:06,676 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:21:06,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 298 events. 11/298 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 603 event pairs, 10 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 240. Up to 34 conditions per place. [2025-02-06 09:21:06,678 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 12 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2025-02-06 09:21:06,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 160 transitions, 351 flow [2025-02-06 09:21:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:21:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:21:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-02-06 09:21:06,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95 [2025-02-06 09:21:06,697 INFO L175 Difference]: Start difference. First operand has 162 places, 159 transitions, 321 flow. Second operand 3 states and 456 transitions. [2025-02-06 09:21:06,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 160 transitions, 351 flow [2025-02-06 09:21:06,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:21:06,706 INFO L231 Difference]: Finished difference. Result has 164 places, 160 transitions, 332 flow [2025-02-06 09:21:06,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=164, PETRI_TRANSITIONS=160} [2025-02-06 09:21:06,712 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 2 predicate places. [2025-02-06 09:21:06,714 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 160 transitions, 332 flow [2025-02-06 09:21:06,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-06 09:21:06,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:06,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:06,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:21:06,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:06,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1372251095, now seen corresponding path program 1 times [2025-02-06 09:21:06,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889345509] [2025-02-06 09:21:06,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:06,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 09:21:06,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 09:21:06,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:06,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:06,910 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-06 09:21:06,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:06,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889345509] [2025-02-06 09:21:06,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889345509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:21:06,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903576674] [2025-02-06 09:21:06,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:06,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:21:06,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:21:06,914 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-06 09:21:06,916 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-06 09:21:06,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 09:21:07,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 09:21:07,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:07,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:07,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:21:07,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:21:07,058 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-06 09:21:07,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:21:07,099 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-06 09:21:07,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903576674] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:21:07,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:21:07,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:21:07,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106032322] [2025-02-06 09:21:07,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:21:07,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:21:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:07,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:21:07,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:21:07,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-02-06 09:21:07,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 160 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 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-06 09:21:07,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:07,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-02-06 09:21:07,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:07,240 INFO L124 PetriNetUnfolderBase]: 11/305 cut-off events. [2025-02-06 09:21:07,241 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:21:07,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 305 events. 11/305 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 600 event pairs, 10 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 277. Up to 34 conditions per place. [2025-02-06 09:21:07,243 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 16 selfloop transitions, 9 changer transitions 0/168 dead transitions. [2025-02-06 09:21:07,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 400 flow [2025-02-06 09:21:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:21:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:21:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1323 transitions. [2025-02-06 09:21:07,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91875 [2025-02-06 09:21:07,245 INFO L175 Difference]: Start difference. First operand has 164 places, 160 transitions, 332 flow. Second operand 9 states and 1323 transitions. [2025-02-06 09:21:07,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 400 flow [2025-02-06 09:21:07,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:21:07,248 INFO L231 Difference]: Finished difference. Result has 174 places, 166 transitions, 380 flow [2025-02-06 09:21:07,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=174, PETRI_TRANSITIONS=166} [2025-02-06 09:21:07,249 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 12 predicate places. [2025-02-06 09:21:07,249 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 380 flow [2025-02-06 09:21:07,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 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-06 09:21:07,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:07,250 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] [2025-02-06 09:21:07,257 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-06 09:21:07,454 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-06 09:21:07,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:07,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:07,455 INFO L85 PathProgramCache]: Analyzing trace with hash -951784887, now seen corresponding path program 2 times [2025-02-06 09:21:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:07,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283128964] [2025-02-06 09:21:07,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:07,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:07,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-02-06 09:21:07,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 100 statements. [2025-02-06 09:21:07,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:07,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:07,887 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-06 09:21:07,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:07,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283128964] [2025-02-06 09:21:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283128964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:07,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:07,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:07,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731185160] [2025-02-06 09:21:07,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:07,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:07,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:07,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:07,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:08,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 160 [2025-02-06 09:21:08,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 166 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 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-06 09:21:08,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:08,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 160 [2025-02-06 09:21:08,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:08,410 INFO L124 PetriNetUnfolderBase]: 285/1089 cut-off events. [2025-02-06 09:21:08,410 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:21:08,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 1089 events. 285/1089 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6337 event pairs, 68 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1628. Up to 287 conditions per place. [2025-02-06 09:21:08,415 INFO L140 encePairwiseOnDemand]: 138/160 looper letters, 98 selfloop transitions, 42 changer transitions 0/276 dead transitions. [2025-02-06 09:21:08,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 276 transitions, 880 flow [2025-02-06 09:21:08,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 922 transitions. [2025-02-06 09:21:08,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604166666666667 [2025-02-06 09:21:08,418 INFO L175 Difference]: Start difference. First operand has 174 places, 166 transitions, 380 flow. Second operand 6 states and 922 transitions. [2025-02-06 09:21:08,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 276 transitions, 880 flow [2025-02-06 09:21:08,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 276 transitions, 874 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:21:08,423 INFO L231 Difference]: Finished difference. Result has 183 places, 212 transitions, 690 flow [2025-02-06 09:21:08,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=690, PETRI_PLACES=183, PETRI_TRANSITIONS=212} [2025-02-06 09:21:08,424 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 21 predicate places. [2025-02-06 09:21:08,424 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 212 transitions, 690 flow [2025-02-06 09:21:08,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 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-06 09:21:08,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:08,425 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] [2025-02-06 09:21:08,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:21:08,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:08,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1952927645, now seen corresponding path program 1 times [2025-02-06 09:21:08,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:08,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646433209] [2025-02-06 09:21:08,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:08,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:08,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:21:08,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:21:08,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:08,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:08,570 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-06 09:21:08,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:08,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646433209] [2025-02-06 09:21:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646433209] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:21:08,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656137323] [2025-02-06 09:21:08,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:08,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:21:08,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:21:08,572 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-06 09:21:08,574 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-06 09:21:08,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:21:08,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:21:08,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:08,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:08,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:21:08,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:21:08,681 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-06 09:21:08,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:21:08,772 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-06 09:21:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656137323] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:21:08,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:21:08,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 09:21:08,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096898266] [2025-02-06 09:21:08,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:21:08,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 09:21:08,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:08,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 09:21:08,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:21:08,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-02-06 09:21:08,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 212 transitions, 690 flow. Second operand has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 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-06 09:21:08,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:08,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-02-06 09:21:08,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:09,076 INFO L124 PetriNetUnfolderBase]: 127/838 cut-off events. [2025-02-06 09:21:09,076 INFO L125 PetriNetUnfolderBase]: For 135/150 co-relation queries the response was YES. [2025-02-06 09:21:09,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 838 events. 127/838 cut-off events. For 135/150 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4670 event pairs, 45 based on Foata normal form. 4/822 useless extension candidates. Maximal degree in co-relation 1359. Up to 132 conditions per place. [2025-02-06 09:21:09,080 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 20 selfloop transitions, 21 changer transitions 0/230 dead transitions. [2025-02-06 09:21:09,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 230 transitions, 860 flow [2025-02-06 09:21:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:21:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:21:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3069 transitions. [2025-02-06 09:21:09,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9133928571428571 [2025-02-06 09:21:09,085 INFO L175 Difference]: Start difference. First operand has 183 places, 212 transitions, 690 flow. Second operand 21 states and 3069 transitions. [2025-02-06 09:21:09,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 230 transitions, 860 flow [2025-02-06 09:21:09,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 230 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:09,093 INFO L231 Difference]: Finished difference. Result has 208 places, 225 transitions, 820 flow [2025-02-06 09:21:09,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=820, PETRI_PLACES=208, PETRI_TRANSITIONS=225} [2025-02-06 09:21:09,095 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 46 predicate places. [2025-02-06 09:21:09,095 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 225 transitions, 820 flow [2025-02-06 09:21:09,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 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-06 09:21:09,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:09,096 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] [2025-02-06 09:21:09,102 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-06 09:21:09,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:21:09,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:09,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash 947106653, now seen corresponding path program 2 times [2025-02-06 09:21:09,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:09,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979800107] [2025-02-06 09:21:09,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:09,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:09,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-02-06 09:21:09,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 86 of 121 statements. [2025-02-06 09:21:09,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:09,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:09,587 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-06 09:21:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979800107] [2025-02-06 09:21:09,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979800107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:09,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:09,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:09,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836616558] [2025-02-06 09:21:09,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:09,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:09,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:09,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:09,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 160 [2025-02-06 09:21:09,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 225 transitions, 820 flow. Second operand has 6 states, 6 states have (on average 142.33333333333334) internal successors, (854), 6 states have internal predecessors, (854), 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-06 09:21:09,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:09,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 160 [2025-02-06 09:21:09,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:09,981 INFO L124 PetriNetUnfolderBase]: 141/900 cut-off events. [2025-02-06 09:21:09,982 INFO L125 PetriNetUnfolderBase]: For 146/168 co-relation queries the response was YES. [2025-02-06 09:21:09,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1642 conditions, 900 events. 141/900 cut-off events. For 146/168 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5158 event pairs, 49 based on Foata normal form. 3/880 useless extension candidates. Maximal degree in co-relation 1444. Up to 129 conditions per place. [2025-02-06 09:21:09,986 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 21 selfloop transitions, 5 changer transitions 0/232 dead transitions. [2025-02-06 09:21:09,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 232 transitions, 886 flow [2025-02-06 09:21:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 873 transitions. [2025-02-06 09:21:09,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909375 [2025-02-06 09:21:09,988 INFO L175 Difference]: Start difference. First operand has 208 places, 225 transitions, 820 flow. Second operand 6 states and 873 transitions. [2025-02-06 09:21:09,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 232 transitions, 886 flow [2025-02-06 09:21:09,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 232 transitions, 862 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 09:21:09,993 INFO L231 Difference]: Finished difference. Result has 206 places, 224 transitions, 804 flow [2025-02-06 09:21:09,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=804, PETRI_PLACES=206, PETRI_TRANSITIONS=224} [2025-02-06 09:21:09,994 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 44 predicate places. [2025-02-06 09:21:09,994 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 224 transitions, 804 flow [2025-02-06 09:21:09,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.33333333333334) internal successors, (854), 6 states have internal predecessors, (854), 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-06 09:21:09,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:09,995 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] [2025-02-06 09:21:09,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:21:09,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:09,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash 764387085, now seen corresponding path program 1 times [2025-02-06 09:21:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:09,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657190276] [2025-02-06 09:21:09,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:21:10,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:21:10,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:10,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:10,254 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-06 09:21:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657190276] [2025-02-06 09:21:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657190276] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:21:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195695949] [2025-02-06 09:21:10,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:10,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:21:10,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:21:10,258 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-06 09:21:10,259 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-06 09:21:10,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:21:10,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:21:10,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:10,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:10,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:21:10,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:21:10,413 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-06 09:21:10,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:21:10,587 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-06 09:21:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195695949] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:21:10,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:21:10,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-06 09:21:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311375268] [2025-02-06 09:21:10,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:21:10,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:21:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:10,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:21:10,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:21:10,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-02-06 09:21:10,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 224 transitions, 804 flow. Second operand has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 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-06 09:21:10,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:10,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-02-06 09:21:10,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:10,951 INFO L124 PetriNetUnfolderBase]: 127/852 cut-off events. [2025-02-06 09:21:10,951 INFO L125 PetriNetUnfolderBase]: For 252/267 co-relation queries the response was YES. [2025-02-06 09:21:10,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 852 events. 127/852 cut-off events. For 252/267 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4687 event pairs, 45 based on Foata normal form. 3/836 useless extension candidates. Maximal degree in co-relation 1370. Up to 132 conditions per place. [2025-02-06 09:21:10,955 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 23 selfloop transitions, 30 changer transitions 0/241 dead transitions. [2025-02-06 09:21:10,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 241 transitions, 1032 flow [2025-02-06 09:21:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:21:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:21:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4376 transitions. [2025-02-06 09:21:10,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9116666666666666 [2025-02-06 09:21:10,962 INFO L175 Difference]: Start difference. First operand has 206 places, 224 transitions, 804 flow. Second operand 30 states and 4376 transitions. [2025-02-06 09:21:10,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 241 transitions, 1032 flow [2025-02-06 09:21:10,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 241 transitions, 1022 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:21:10,968 INFO L231 Difference]: Finished difference. Result has 234 places, 234 transitions, 946 flow [2025-02-06 09:21:10,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=946, PETRI_PLACES=234, PETRI_TRANSITIONS=234} [2025-02-06 09:21:10,969 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 72 predicate places. [2025-02-06 09:21:10,969 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 234 transitions, 946 flow [2025-02-06 09:21:10,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 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-06 09:21:10,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:10,970 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] [2025-02-06 09:21:10,976 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-06 09:21:11,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:21:11,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:11,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1371972886, now seen corresponding path program 2 times [2025-02-06 09:21:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:11,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023845233] [2025-02-06 09:21:11,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:11,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-02-06 09:21:11,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 143 statements. [2025-02-06 09:21:11,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:11,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:11,435 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-06 09:21:11,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:11,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023845233] [2025-02-06 09:21:11,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023845233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:11,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:11,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:11,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461628412] [2025-02-06 09:21:11,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:11,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:11,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:11,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:11,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:11,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 160 [2025-02-06 09:21:11,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 234 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 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-06 09:21:11,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:11,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 160 [2025-02-06 09:21:11,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:11,901 INFO L124 PetriNetUnfolderBase]: 445/1510 cut-off events. [2025-02-06 09:21:11,901 INFO L125 PetriNetUnfolderBase]: For 719/753 co-relation queries the response was YES. [2025-02-06 09:21:11,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1510 events. 445/1510 cut-off events. For 719/753 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9423 event pairs, 117 based on Foata normal form. 24/1510 useless extension candidates. Maximal degree in co-relation 3398. Up to 640 conditions per place. [2025-02-06 09:21:11,908 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 109 selfloop transitions, 53 changer transitions 6/325 dead transitions. [2025-02-06 09:21:11,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 325 transitions, 1650 flow [2025-02-06 09:21:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2025-02-06 09:21:11,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91875 [2025-02-06 09:21:11,911 INFO L175 Difference]: Start difference. First operand has 234 places, 234 transitions, 946 flow. Second operand 6 states and 882 transitions. [2025-02-06 09:21:11,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 325 transitions, 1650 flow [2025-02-06 09:21:11,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 325 transitions, 1604 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-06 09:21:11,920 INFO L231 Difference]: Finished difference. Result has 226 places, 285 transitions, 1406 flow [2025-02-06 09:21:11,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1406, PETRI_PLACES=226, PETRI_TRANSITIONS=285} [2025-02-06 09:21:11,922 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 64 predicate places. [2025-02-06 09:21:11,922 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 285 transitions, 1406 flow [2025-02-06 09:21:11,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 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-06 09:21:11,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:11,923 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] [2025-02-06 09:21:11,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:21:11,923 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:11,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2033500526, now seen corresponding path program 1 times [2025-02-06 09:21:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828232695] [2025-02-06 09:21:11,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:11,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:11,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 09:21:11,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 09:21:11,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:11,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:12,246 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-06 09:21:12,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:12,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828232695] [2025-02-06 09:21:12,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828232695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:12,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:12,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978373513] [2025-02-06 09:21:12,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:12,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:12,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:12,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:12,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:12,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 160 [2025-02-06 09:21:12,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 285 transitions, 1406 flow. Second operand has 6 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 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-06 09:21:12,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:12,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 160 [2025-02-06 09:21:12,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:12,685 INFO L124 PetriNetUnfolderBase]: 255/1247 cut-off events. [2025-02-06 09:21:12,686 INFO L125 PetriNetUnfolderBase]: For 1032/1105 co-relation queries the response was YES. [2025-02-06 09:21:12,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3042 conditions, 1247 events. 255/1247 cut-off events. For 1032/1105 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7961 event pairs, 57 based on Foata normal form. 9/1235 useless extension candidates. Maximal degree in co-relation 2783. Up to 215 conditions per place. [2025-02-06 09:21:12,690 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 25 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2025-02-06 09:21:12,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 292 transitions, 1480 flow [2025-02-06 09:21:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 853 transitions. [2025-02-06 09:21:12,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8885416666666667 [2025-02-06 09:21:12,692 INFO L175 Difference]: Start difference. First operand has 226 places, 285 transitions, 1406 flow. Second operand 6 states and 853 transitions. [2025-02-06 09:21:12,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 292 transitions, 1480 flow [2025-02-06 09:21:12,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 292 transitions, 1472 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:12,701 INFO L231 Difference]: Finished difference. Result has 230 places, 284 transitions, 1406 flow [2025-02-06 09:21:12,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1406, PETRI_PLACES=230, PETRI_TRANSITIONS=284} [2025-02-06 09:21:12,702 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 68 predicate places. [2025-02-06 09:21:12,702 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 284 transitions, 1406 flow [2025-02-06 09:21:12,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 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-06 09:21:12,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:12,702 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, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:12,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:21:12,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:12,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:12,703 INFO L85 PathProgramCache]: Analyzing trace with hash 730960213, now seen corresponding path program 1 times [2025-02-06 09:21:12,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:12,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531101534] [2025-02-06 09:21:12,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:12,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:12,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:21:12,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:21:12,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:12,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:13,068 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-06 09:21:13,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:13,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531101534] [2025-02-06 09:21:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531101534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:13,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:13,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:21:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229151783] [2025-02-06 09:21:13,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:13,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:21:13,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:13,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:21:13,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:21:13,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 160 [2025-02-06 09:21:13,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 284 transitions, 1406 flow. Second operand has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 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-06 09:21:13,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:13,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 160 [2025-02-06 09:21:13,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:13,534 INFO L124 PetriNetUnfolderBase]: 594/1878 cut-off events. [2025-02-06 09:21:13,534 INFO L125 PetriNetUnfolderBase]: For 2513/2558 co-relation queries the response was YES. [2025-02-06 09:21:13,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 1878 events. 594/1878 cut-off events. For 2513/2558 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12323 event pairs, 150 based on Foata normal form. 25/1870 useless extension candidates. Maximal degree in co-relation 5424. Up to 891 conditions per place. [2025-02-06 09:21:13,543 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 122 selfloop transitions, 58 changer transitions 39/376 dead transitions. [2025-02-06 09:21:13,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 376 transitions, 2368 flow [2025-02-06 09:21:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:21:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:21:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 864 transitions. [2025-02-06 09:21:13,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-02-06 09:21:13,546 INFO L175 Difference]: Start difference. First operand has 230 places, 284 transitions, 1406 flow. Second operand 6 states and 864 transitions. [2025-02-06 09:21:13,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 376 transitions, 2368 flow [2025-02-06 09:21:13,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 376 transitions, 2358 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:21:13,583 INFO L231 Difference]: Finished difference. Result has 234 places, 311 transitions, 1804 flow [2025-02-06 09:21:13,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1804, PETRI_PLACES=234, PETRI_TRANSITIONS=311} [2025-02-06 09:21:13,584 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 72 predicate places. [2025-02-06 09:21:13,584 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 311 transitions, 1804 flow [2025-02-06 09:21:13,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 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-06 09:21:13,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:13,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:21:13,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:21:13,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:13,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash -655417679, now seen corresponding path program 1 times [2025-02-06 09:21:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:13,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550058424] [2025-02-06 09:21:13,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:21:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:13,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 09:21:13,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 09:21:13,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:13,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:13,695 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-06 09:21:13,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:13,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550058424] [2025-02-06 09:21:13,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550058424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:13,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:13,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:21:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562029412] [2025-02-06 09:21:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:13,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:21:13,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:13,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:21:13,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:21:13,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 160 [2025-02-06 09:21:13,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 311 transitions, 1804 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-06 09:21:13,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:13,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 160 [2025-02-06 09:21:13,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:13,792 INFO L124 PetriNetUnfolderBase]: 6/275 cut-off events. [2025-02-06 09:21:13,793 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2025-02-06 09:21:13,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 275 events. 6/275 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs, 0 based on Foata normal form. 2/276 useless extension candidates. Maximal degree in co-relation 441. Up to 23 conditions per place. [2025-02-06 09:21:13,795 INFO L140 encePairwiseOnDemand]: 156/160 looper letters, 0 selfloop transitions, 0 changer transitions 185/185 dead transitions. [2025-02-06 09:21:13,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 185 transitions, 738 flow [2025-02-06 09:21:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:21:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:21:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2025-02-06 09:21:13,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708333333333333 [2025-02-06 09:21:13,796 INFO L175 Difference]: Start difference. First operand has 234 places, 311 transitions, 1804 flow. Second operand 3 states and 466 transitions. [2025-02-06 09:21:13,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 185 transitions, 738 flow [2025-02-06 09:21:13,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 185 transitions, 600 flow, removed 30 selfloop flow, removed 29 redundant places. [2025-02-06 09:21:13,801 INFO L231 Difference]: Finished difference. Result has 203 places, 0 transitions, 0 flow [2025-02-06 09:21:13,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=203, PETRI_TRANSITIONS=0} [2025-02-06 09:21:13,802 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 41 predicate places. [2025-02-06 09:21:13,802 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 0 transitions, 0 flow [2025-02-06 09:21:13,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-06 09:21:13,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-02-06 09:21:13,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-06 09:21:13,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-06 09:21:13,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-06 09:21:13,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-02-06 09:21:13,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-06 09:21:13,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-06 09:21:13,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-06 09:21:13,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-06 09:21:13,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:21:13,806 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2025-02-06 09:21:13,809 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:21:13,810 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:21:13,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:21:13 BasicIcfg [2025-02-06 09:21:13,816 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:21:13,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:21:13,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:21:13,816 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:21:13,817 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:21:05" (3/4) ... [2025-02-06 09:21:13,818 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:21:13,820 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-06 09:21:13,824 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 09:21:13,825 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 09:21:13,825 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 09:21:13,876 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:21:13,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:21:13,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:21:13,877 INFO L158 Benchmark]: Toolchain (without parser) took 8698.46ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 104.9MB in the beginning and 214.9MB in the end (delta: -110.1MB). Peak memory consumption was 125.9MB. Max. memory is 16.1GB. [2025-02-06 09:21:13,878 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:21:13,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.89ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 83.8MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:21:13,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.52ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 81.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:21:13,878 INFO L158 Benchmark]: Boogie Preprocessor took 29.81ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:21:13,878 INFO L158 Benchmark]: IcfgBuilder took 419.20ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 57.5MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:21:13,878 INFO L158 Benchmark]: TraceAbstraction took 7821.35ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 56.5MB in the beginning and 223.3MB in the end (delta: -166.9MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2025-02-06 09:21:13,879 INFO L158 Benchmark]: Witness Printer took 60.69ms. Allocated memory is still 377.5MB. Free memory was 223.3MB in the beginning and 214.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:21:13,880 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.89ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 83.8MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.52ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 81.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.81ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 419.20ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 57.5MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7821.35ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 56.5MB in the beginning and 223.3MB in the end (delta: -166.9MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. * Witness Printer took 60.69ms. Allocated memory is still 377.5MB. Free memory was 223.3MB in the beginning and 214.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 693]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 693]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 683]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 683]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 188 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.7s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1127 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 731 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2532 IncrementalHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 16 mSDtfsCounter, 2532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 733 GetRequests, 621 SyntacticMatches, 11 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1804occurred in iteration=9, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1566 NumberOfCodeBlocks, 1466 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1869 ConstructedInterpolants, 0 QuantifiedInterpolants, 2680 SizeOfPredicates, 22 NumberOfNonLiveVariables, 721 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 1070/1463 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:21:13,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE