./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.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/ldv-races/race-3_2-container_of-global.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 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:15:38,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:15:38,973 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:15:38,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:15:38,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:15:38,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:15:39,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:15:39,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:15:39,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:15:39,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:15:39,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:15:39,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:15:39,002 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:15:39,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:15:39,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:15:39,002 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:15:39,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:15:39,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:15:39,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:15:39,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:15:39,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:15:39,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:15:39,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:15:39,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:15:39,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:15:39,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:15:39,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:15:39,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:15:39,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:15:39,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:15:39,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:15:39,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:15:39,005 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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2025-02-06 09:15:39,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:15:39,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:15:39,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:15:39,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:15:39,270 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:15:39,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-02-06 09:15:40,449 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/916ff7f38/8711af5a63c041df9a6a22710fd07188/FLAGbc4060900 [2025-02-06 09:15:40,833 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:15:40,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-02-06 09:15:40,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/916ff7f38/8711af5a63c041df9a6a22710fd07188/FLAGbc4060900 [2025-02-06 09:15:40,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/916ff7f38/8711af5a63c041df9a6a22710fd07188 [2025-02-06 09:15:40,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:15:40,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:15:40,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:15:40,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:15:40,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:15:40,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:15:40" (1/1) ... [2025-02-06 09:15:40,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ef72f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:40, skipping insertion in model container [2025-02-06 09:15:40,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:15:40" (1/1) ... [2025-02-06 09:15:40,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:15:41,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:15:41,162 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:15:41,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:15:41,237 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:15:41,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41 WrapperNode [2025-02-06 09:15:41,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:15:41,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:15:41,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:15:41,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:15:41,243 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:15:41" (1/1) ... [2025-02-06 09:15:41,262 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:15:41" (1/1) ... [2025-02-06 09:15:41,287 INFO L138 Inliner]: procedures = 246, calls = 44, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 219 [2025-02-06 09:15:41,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:15:41,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:15:41,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:15:41,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:15:41,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41" (1/1) ... [2025-02-06 09:15:41,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41" (1/1) ... [2025-02-06 09:15:41,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41" (1/1) ... [2025-02-06 09:15:41,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41" (1/1) ... [2025-02-06 09:15:41,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41" (1/1) ... [2025-02-06 09:15:41,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41" (1/1) ... [2025-02-06 09:15:41,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41" (1/1) ... [2025-02-06 09:15:41,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41" (1/1) ... [2025-02-06 09:15:41,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:15:41,333 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:15:41,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:15:41,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:15:41,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41" (1/1) ... [2025-02-06 09:15:41,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:15:41,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:15:41,368 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:15:41,373 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:15:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-02-06 09:15:41,386 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-02-06 09:15:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 09:15:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:15:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:15:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 09:15:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:15:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:15:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:15:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:15:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:15:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:15:41,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:15:41,388 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:15:41,571 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:15:41,572 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:15:41,872 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:15:41,872 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:15:41,910 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:15:41,910 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:15:41,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:15:41 BoogieIcfgContainer [2025-02-06 09:15:41,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:15:41,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:15:41,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:15:41,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:15:41,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:15:40" (1/3) ... [2025-02-06 09:15:41,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cac9c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:15:41, skipping insertion in model container [2025-02-06 09:15:41,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:15:41" (2/3) ... [2025-02-06 09:15:41,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cac9c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:15:41, skipping insertion in model container [2025-02-06 09:15:41,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:15:41" (3/3) ... [2025-02-06 09:15:41,919 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2025-02-06 09:15:41,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:15:41,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 272 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-02-06 09:15:41,932 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:15:42,010 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:15:42,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 624 flow [2025-02-06 09:15:42,172 INFO L124 PetriNetUnfolderBase]: 18/389 cut-off events. [2025-02-06 09:15:42,177 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:15:42,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 389 events. 18/389 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 700 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 225. Up to 4 conditions per place. [2025-02-06 09:15:42,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 305 transitions, 624 flow [2025-02-06 09:15:42,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 302 transitions, 616 flow [2025-02-06 09:15:42,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:15:42,210 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;@18537300, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:15:42,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-06 09:15:42,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:15:42,220 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-02-06 09:15:42,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:15:42,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:42,221 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] [2025-02-06 09:15:42,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:42,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1432301260, now seen corresponding path program 1 times [2025-02-06 09:15:42,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:42,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100011031] [2025-02-06 09:15:42,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:42,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:42,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 09:15:42,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 09:15:42,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:42,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:42,995 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:15:42,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:42,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100011031] [2025-02-06 09:15:42,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100011031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:42,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:42,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:15:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328125947] [2025-02-06 09:15:43,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:43,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:15:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:43,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:15:43,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:15:43,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 305 [2025-02-06 09:15:43,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 302 transitions, 616 flow. Second operand has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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:15:43,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:43,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 305 [2025-02-06 09:15:43,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:43,607 INFO L124 PetriNetUnfolderBase]: 424/1621 cut-off events. [2025-02-06 09:15:43,608 INFO L125 PetriNetUnfolderBase]: For 20/22 co-relation queries the response was YES. [2025-02-06 09:15:43,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 1621 events. 424/1621 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10268 event pairs, 423 based on Foata normal form. 60/1573 useless extension candidates. Maximal degree in co-relation 2107. Up to 755 conditions per place. [2025-02-06 09:15:43,619 INFO L140 encePairwiseOnDemand]: 281/305 looper letters, 44 selfloop transitions, 5 changer transitions 12/265 dead transitions. [2025-02-06 09:15:43,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 265 transitions, 640 flow [2025-02-06 09:15:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:15:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:15:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1454 transitions. [2025-02-06 09:15:43,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7945355191256831 [2025-02-06 09:15:43,632 INFO L175 Difference]: Start difference. First operand has 295 places, 302 transitions, 616 flow. Second operand 6 states and 1454 transitions. [2025-02-06 09:15:43,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 265 transitions, 640 flow [2025-02-06 09:15:43,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 265 transitions, 632 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:15:43,640 INFO L231 Difference]: Finished difference. Result has 271 places, 253 transitions, 520 flow [2025-02-06 09:15:43,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=271, PETRI_TRANSITIONS=253} [2025-02-06 09:15:43,644 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -24 predicate places. [2025-02-06 09:15:43,644 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 253 transitions, 520 flow [2025-02-06 09:15:43,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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:15:43,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:43,645 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] [2025-02-06 09:15:43,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:15:43,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:43,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1547785665, now seen corresponding path program 1 times [2025-02-06 09:15:43,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:43,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533923131] [2025-02-06 09:15:43,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:43,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:43,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:15:43,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:15:43,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:43,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:44,007 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:15:44,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:44,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533923131] [2025-02-06 09:15:44,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533923131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:44,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:44,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:15:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555933363] [2025-02-06 09:15:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:44,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:15:44,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:44,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:15:44,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:15:44,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 305 [2025-02-06 09:15:44,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 253 transitions, 520 flow. Second operand has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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:15:44,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:44,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 305 [2025-02-06 09:15:44,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:44,455 INFO L124 PetriNetUnfolderBase]: 424/1608 cut-off events. [2025-02-06 09:15:44,456 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-02-06 09:15:44,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 1608 events. 424/1608 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10227 event pairs, 423 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 2337. Up to 755 conditions per place. [2025-02-06 09:15:44,463 INFO L140 encePairwiseOnDemand]: 299/305 looper letters, 44 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2025-02-06 09:15:44,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 252 transitions, 616 flow [2025-02-06 09:15:44,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:15:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:15:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1436 transitions. [2025-02-06 09:15:44,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7846994535519126 [2025-02-06 09:15:44,466 INFO L175 Difference]: Start difference. First operand has 271 places, 253 transitions, 520 flow. Second operand 6 states and 1436 transitions. [2025-02-06 09:15:44,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 252 transitions, 616 flow [2025-02-06 09:15:44,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 252 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:15:44,469 INFO L231 Difference]: Finished difference. Result has 258 places, 252 transitions, 518 flow [2025-02-06 09:15:44,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=258, PETRI_TRANSITIONS=252} [2025-02-06 09:15:44,470 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2025-02-06 09:15:44,470 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 252 transitions, 518 flow [2025-02-06 09:15:44,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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:15:44,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:44,472 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] [2025-02-06 09:15:44,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:15:44,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:44,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1197698700, now seen corresponding path program 1 times [2025-02-06 09:15:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:44,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327983905] [2025-02-06 09:15:44,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:44,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:44,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 09:15:44,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 09:15:44,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:44,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:44,920 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:15:44,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:44,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327983905] [2025-02-06 09:15:44,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327983905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:44,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:44,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:15:44,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214877167] [2025-02-06 09:15:44,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:44,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:15:44,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:44,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:15:44,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:15:45,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 305 [2025-02-06 09:15:45,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 252 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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:15:45,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:45,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 305 [2025-02-06 09:15:45,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:45,470 INFO L124 PetriNetUnfolderBase]: 232/817 cut-off events. [2025-02-06 09:15:45,471 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-02-06 09:15:45,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 817 events. 232/817 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3895 event pairs, 210 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1195. Up to 415 conditions per place. [2025-02-06 09:15:45,475 INFO L140 encePairwiseOnDemand]: 297/305 looper letters, 28 selfloop transitions, 7 changer transitions 0/255 dead transitions. [2025-02-06 09:15:45,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 255 transitions, 595 flow [2025-02-06 09:15:45,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:15:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:15:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2025-02-06 09:15:45,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2025-02-06 09:15:45,478 INFO L175 Difference]: Start difference. First operand has 258 places, 252 transitions, 518 flow. Second operand 6 states and 1530 transitions. [2025-02-06 09:15:45,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 255 transitions, 595 flow [2025-02-06 09:15:45,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 255 transitions, 585 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:15:45,487 INFO L231 Difference]: Finished difference. Result has 258 places, 254 transitions, 536 flow [2025-02-06 09:15:45,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=536, PETRI_PLACES=258, PETRI_TRANSITIONS=254} [2025-02-06 09:15:45,488 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2025-02-06 09:15:45,488 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 254 transitions, 536 flow [2025-02-06 09:15:45,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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:15:45,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:45,489 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] [2025-02-06 09:15:45,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:15:45,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:45,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:45,490 INFO L85 PathProgramCache]: Analyzing trace with hash 770905336, now seen corresponding path program 1 times [2025-02-06 09:15:45,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:45,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656527191] [2025-02-06 09:15:45,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:45,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:45,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 09:15:45,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 09:15:45,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:45,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:15:45,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:45,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656527191] [2025-02-06 09:15:45,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656527191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:45,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:45,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:15:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913910972] [2025-02-06 09:15:45,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:45,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:15:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:45,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:15:45,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:15:46,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 305 [2025-02-06 09:15:46,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 254 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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:15:46,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:46,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 305 [2025-02-06 09:15:46,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:46,269 INFO L124 PetriNetUnfolderBase]: 232/816 cut-off events. [2025-02-06 09:15:46,269 INFO L125 PetriNetUnfolderBase]: For 80/84 co-relation queries the response was YES. [2025-02-06 09:15:46,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 816 events. 232/816 cut-off events. For 80/84 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3891 event pairs, 210 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 1001. Up to 415 conditions per place. [2025-02-06 09:15:46,273 INFO L140 encePairwiseOnDemand]: 297/305 looper letters, 28 selfloop transitions, 7 changer transitions 0/254 dead transitions. [2025-02-06 09:15:46,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 254 transitions, 607 flow [2025-02-06 09:15:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:15:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:15:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2025-02-06 09:15:46,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2025-02-06 09:15:46,276 INFO L175 Difference]: Start difference. First operand has 258 places, 254 transitions, 536 flow. Second operand 6 states and 1530 transitions. [2025-02-06 09:15:46,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 254 transitions, 607 flow [2025-02-06 09:15:46,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 254 transitions, 597 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:15:46,279 INFO L231 Difference]: Finished difference. Result has 258 places, 253 transitions, 538 flow [2025-02-06 09:15:46,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=258, PETRI_TRANSITIONS=253} [2025-02-06 09:15:46,280 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2025-02-06 09:15:46,281 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 538 flow [2025-02-06 09:15:46,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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:15:46,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:46,282 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] [2025-02-06 09:15:46,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:15:46,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:46,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:46,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1360502104, now seen corresponding path program 1 times [2025-02-06 09:15:46,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:46,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965211665] [2025-02-06 09:15:46,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:46,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:46,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 09:15:46,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 09:15:46,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:46,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:15:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965211665] [2025-02-06 09:15:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965211665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:46,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:46,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:15:46,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164901300] [2025-02-06 09:15:46,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:46,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:15:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:46,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:15:46,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:15:46,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 305 [2025-02-06 09:15:46,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:15:46,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:46,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 305 [2025-02-06 09:15:46,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:46,402 INFO L124 PetriNetUnfolderBase]: 65/533 cut-off events. [2025-02-06 09:15:46,402 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-06 09:15:46,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 533 events. 65/533 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2179 event pairs, 40 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 291. Up to 130 conditions per place. [2025-02-06 09:15:46,404 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 19 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2025-02-06 09:15:46,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 252 transitions, 578 flow [2025-02-06 09:15:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:15:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:15:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2025-02-06 09:15:46,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8797814207650273 [2025-02-06 09:15:46,406 INFO L175 Difference]: Start difference. First operand has 258 places, 253 transitions, 538 flow. Second operand 3 states and 805 transitions. [2025-02-06 09:15:46,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 252 transitions, 578 flow [2025-02-06 09:15:46,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 252 transitions, 564 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:15:46,409 INFO L231 Difference]: Finished difference. Result has 254 places, 252 transitions, 526 flow [2025-02-06 09:15:46,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=254, PETRI_TRANSITIONS=252} [2025-02-06 09:15:46,410 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -41 predicate places. [2025-02-06 09:15:46,410 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 252 transitions, 526 flow [2025-02-06 09:15:46,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:15:46,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:46,411 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] [2025-02-06 09:15:46,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:15:46,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:46,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash -117261809, now seen corresponding path program 1 times [2025-02-06 09:15:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860884674] [2025-02-06 09:15:46,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:46,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 09:15:46,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 09:15:46,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:46,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:15:46,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860884674] [2025-02-06 09:15:46,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860884674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:46,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:46,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:15:46,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292778518] [2025-02-06 09:15:46,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:46,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:15:46,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:46,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:15:46,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:15:46,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 305 [2025-02-06 09:15:46,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 252 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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:15:46,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:46,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 305 [2025-02-06 09:15:46,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:46,525 INFO L124 PetriNetUnfolderBase]: 67/474 cut-off events. [2025-02-06 09:15:46,525 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2025-02-06 09:15:46,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 474 events. 67/474 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1718 event pairs, 45 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 497. Up to 128 conditions per place. [2025-02-06 09:15:46,527 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 21 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-02-06 09:15:46,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 578 flow [2025-02-06 09:15:46,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:15:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:15:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2025-02-06 09:15:46,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8852459016393442 [2025-02-06 09:15:46,529 INFO L175 Difference]: Start difference. First operand has 254 places, 252 transitions, 526 flow. Second operand 3 states and 810 transitions. [2025-02-06 09:15:46,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 578 flow [2025-02-06 09:15:46,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:15:46,532 INFO L231 Difference]: Finished difference. Result has 253 places, 251 transitions, 524 flow [2025-02-06 09:15:46,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=253, PETRI_TRANSITIONS=251} [2025-02-06 09:15:46,533 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -42 predicate places. [2025-02-06 09:15:46,533 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 524 flow [2025-02-06 09:15:46,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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:15:46,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:46,534 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] [2025-02-06 09:15:46,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:15:46,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:46,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1320388840, now seen corresponding path program 1 times [2025-02-06 09:15:46,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:46,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153639046] [2025-02-06 09:15:46,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:46,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:46,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 09:15:46,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 09:15:46,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:46,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:15:46,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:46,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153639046] [2025-02-06 09:15:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153639046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:46,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:15:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894451997] [2025-02-06 09:15:46,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:46,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:15:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:46,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:15:46,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:15:46,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 305 [2025-02-06 09:15:46,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 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:15:46,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:46,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 305 [2025-02-06 09:15:46,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:46,681 INFO L124 PetriNetUnfolderBase]: 75/555 cut-off events. [2025-02-06 09:15:46,681 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-06 09:15:46,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 555 events. 75/555 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1837 event pairs, 18 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 577. Up to 90 conditions per place. [2025-02-06 09:15:46,684 INFO L140 encePairwiseOnDemand]: 303/305 looper letters, 20 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2025-02-06 09:15:46,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 256 transitions, 580 flow [2025-02-06 09:15:46,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:15:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:15:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2025-02-06 09:15:46,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972677595628415 [2025-02-06 09:15:46,686 INFO L175 Difference]: Start difference. First operand has 253 places, 251 transitions, 524 flow. Second operand 3 states and 821 transitions. [2025-02-06 09:15:46,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 256 transitions, 580 flow [2025-02-06 09:15:46,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 256 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:15:46,689 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 520 flow [2025-02-06 09:15:46,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2025-02-06 09:15:46,690 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -43 predicate places. [2025-02-06 09:15:46,691 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 520 flow [2025-02-06 09:15:46,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 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:15:46,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:46,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:15:46,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:15:46,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:46,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash -68707559, now seen corresponding path program 1 times [2025-02-06 09:15:46,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:46,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328639841] [2025-02-06 09:15:46,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:46,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:46,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 09:15:46,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 09:15:46,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:46,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:15:46,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328639841] [2025-02-06 09:15:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328639841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:46,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:46,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:15:46,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029394966] [2025-02-06 09:15:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:46,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:15:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:46,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:15:46,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:15:46,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 305 [2025-02-06 09:15:46,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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:15:46,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:46,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 305 [2025-02-06 09:15:46,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:46,822 INFO L124 PetriNetUnfolderBase]: 64/680 cut-off events. [2025-02-06 09:15:46,822 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-06 09:15:46,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 680 events. 64/680 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2668 event pairs, 44 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 715. Up to 130 conditions per place. [2025-02-06 09:15:46,825 INFO L140 encePairwiseOnDemand]: 301/305 looper letters, 18 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2025-02-06 09:15:46,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 251 transitions, 563 flow [2025-02-06 09:15:46,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:15:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:15:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2025-02-06 09:15:46,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8874316939890711 [2025-02-06 09:15:46,828 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 520 flow. Second operand 3 states and 812 transitions. [2025-02-06 09:15:46,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 251 transitions, 563 flow [2025-02-06 09:15:46,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 251 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:15:46,832 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 529 flow [2025-02-06 09:15:46,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2025-02-06 09:15:46,832 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -43 predicate places. [2025-02-06 09:15:46,833 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 529 flow [2025-02-06 09:15:46,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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:15:46,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:46,834 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] [2025-02-06 09:15:46,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:15:46,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:46,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1010476882, now seen corresponding path program 1 times [2025-02-06 09:15:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:46,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802422146] [2025-02-06 09:15:46,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:46,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:15:46,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:15:46,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:46,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:15:47,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802422146] [2025-02-06 09:15:47,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802422146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:47,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:47,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:15:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855662369] [2025-02-06 09:15:47,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:47,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:15:47,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:47,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:15:47,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:15:47,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 305 [2025-02-06 09:15:47,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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:15:47,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:47,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 305 [2025-02-06 09:15:47,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:47,760 INFO L124 PetriNetUnfolderBase]: 578/1724 cut-off events. [2025-02-06 09:15:47,760 INFO L125 PetriNetUnfolderBase]: For 171/180 co-relation queries the response was YES. [2025-02-06 09:15:47,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3004 conditions, 1724 events. 578/1724 cut-off events. For 171/180 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 9894 event pairs, 347 based on Foata normal form. 0/1644 useless extension candidates. Maximal degree in co-relation 2473. Up to 943 conditions per place. [2025-02-06 09:15:47,768 INFO L140 encePairwiseOnDemand]: 292/305 looper letters, 50 selfloop transitions, 30 changer transitions 0/279 dead transitions. [2025-02-06 09:15:47,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 279 transitions, 763 flow [2025-02-06 09:15:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:15:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:15:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2025-02-06 09:15:47,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038251366120218 [2025-02-06 09:15:47,771 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 529 flow. Second operand 6 states and 1471 transitions. [2025-02-06 09:15:47,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 279 transitions, 763 flow [2025-02-06 09:15:47,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 279 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:15:47,775 INFO L231 Difference]: Finished difference. Result has 262 places, 279 transitions, 747 flow [2025-02-06 09:15:47,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=747, PETRI_PLACES=262, PETRI_TRANSITIONS=279} [2025-02-06 09:15:47,776 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -33 predicate places. [2025-02-06 09:15:47,776 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 279 transitions, 747 flow [2025-02-06 09:15:47,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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:15:47,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:47,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:15:47,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:15:47,777 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:47,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash -375758158, now seen corresponding path program 1 times [2025-02-06 09:15:47,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:47,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729580536] [2025-02-06 09:15:47,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:47,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:47,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:15:47,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:15:47,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:47,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:15:47,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:47,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729580536] [2025-02-06 09:15:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729580536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:47,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:47,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:15:47,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537593562] [2025-02-06 09:15:47,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:47,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:15:47,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:47,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:15:47,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:15:47,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 305 [2025-02-06 09:15:47,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 279 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 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:15:47,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:47,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 305 [2025-02-06 09:15:47,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:48,014 INFO L124 PetriNetUnfolderBase]: 332/1161 cut-off events. [2025-02-06 09:15:48,014 INFO L125 PetriNetUnfolderBase]: For 608/629 co-relation queries the response was YES. [2025-02-06 09:15:48,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 1161 events. 332/1161 cut-off events. For 608/629 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6045 event pairs, 99 based on Foata normal form. 2/1126 useless extension candidates. Maximal degree in co-relation 2135. Up to 403 conditions per place. [2025-02-06 09:15:48,020 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 50 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2025-02-06 09:15:48,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 286 transitions, 885 flow [2025-02-06 09:15:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:15:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:15:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2025-02-06 09:15:48,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8885245901639345 [2025-02-06 09:15:48,023 INFO L175 Difference]: Start difference. First operand has 262 places, 279 transitions, 747 flow. Second operand 3 states and 813 transitions. [2025-02-06 09:15:48,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 286 transitions, 885 flow [2025-02-06 09:15:48,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 286 transitions, 869 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-02-06 09:15:48,029 INFO L231 Difference]: Finished difference. Result has 263 places, 278 transitions, 733 flow [2025-02-06 09:15:48,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=263, PETRI_TRANSITIONS=278} [2025-02-06 09:15:48,030 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -32 predicate places. [2025-02-06 09:15:48,030 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 278 transitions, 733 flow [2025-02-06 09:15:48,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 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:15:48,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:48,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:15:48,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:15:48,031 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:48,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:48,031 INFO L85 PathProgramCache]: Analyzing trace with hash 436136059, now seen corresponding path program 1 times [2025-02-06 09:15:48,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:48,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435885074] [2025-02-06 09:15:48,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:48,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 09:15:48,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 09:15:48,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:48,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:15:48,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435885074] [2025-02-06 09:15:48,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435885074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:48,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:48,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:15:48,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836102088] [2025-02-06 09:15:48,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:48,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:15:48,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:48,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:15:48,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:15:48,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 305 [2025-02-06 09:15:48,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 278 transitions, 733 flow. Second operand has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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:15:48,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:48,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 305 [2025-02-06 09:15:48,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:48,994 INFO L124 PetriNetUnfolderBase]: 828/2332 cut-off events. [2025-02-06 09:15:48,994 INFO L125 PetriNetUnfolderBase]: For 1076/1100 co-relation queries the response was YES. [2025-02-06 09:15:48,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5280 conditions, 2332 events. 828/2332 cut-off events. For 1076/1100 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14694 event pairs, 419 based on Foata normal form. 0/2248 useless extension candidates. Maximal degree in co-relation 5026. Up to 1225 conditions per place. [2025-02-06 09:15:49,005 INFO L140 encePairwiseOnDemand]: 292/305 looper letters, 74 selfloop transitions, 30 changer transitions 0/307 dead transitions. [2025-02-06 09:15:49,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 307 transitions, 1063 flow [2025-02-06 09:15:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:15:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:15:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2025-02-06 09:15:49,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038251366120218 [2025-02-06 09:15:49,008 INFO L175 Difference]: Start difference. First operand has 263 places, 278 transitions, 733 flow. Second operand 6 states and 1471 transitions. [2025-02-06 09:15:49,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 307 transitions, 1063 flow [2025-02-06 09:15:49,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 307 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:15:49,014 INFO L231 Difference]: Finished difference. Result has 271 places, 307 transitions, 995 flow [2025-02-06 09:15:49,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=995, PETRI_PLACES=271, PETRI_TRANSITIONS=307} [2025-02-06 09:15:49,015 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -24 predicate places. [2025-02-06 09:15:49,015 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 307 transitions, 995 flow [2025-02-06 09:15:49,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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:15:49,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:49,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:15:49,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:15:49,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:49,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1716192315, now seen corresponding path program 1 times [2025-02-06 09:15:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:49,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182131674] [2025-02-06 09:15:49,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:49,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 09:15:49,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 09:15:49,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:49,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:15:49,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:49,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182131674] [2025-02-06 09:15:49,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182131674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:49,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:49,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:15:49,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119487293] [2025-02-06 09:15:49,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:49,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:15:49,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:49,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:15:49,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:15:49,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 305 [2025-02-06 09:15:49,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 307 transitions, 995 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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:15:49,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:49,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 305 [2025-02-06 09:15:49,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:50,020 INFO L124 PetriNetUnfolderBase]: 925/2856 cut-off events. [2025-02-06 09:15:50,020 INFO L125 PetriNetUnfolderBase]: For 2135/2171 co-relation queries the response was YES. [2025-02-06 09:15:50,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7371 conditions, 2856 events. 925/2856 cut-off events. For 2135/2171 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 19881 event pairs, 307 based on Foata normal form. 0/2738 useless extension candidates. Maximal degree in co-relation 6285. Up to 1290 conditions per place. [2025-02-06 09:15:50,071 INFO L140 encePairwiseOnDemand]: 288/305 looper letters, 96 selfloop transitions, 27 changer transitions 0/336 dead transitions. [2025-02-06 09:15:50,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 336 transitions, 1415 flow [2025-02-06 09:15:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:15:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:15:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions. [2025-02-06 09:15:50,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289617486338798 [2025-02-06 09:15:50,074 INFO L175 Difference]: Start difference. First operand has 271 places, 307 transitions, 995 flow. Second operand 6 states and 1517 transitions. [2025-02-06 09:15:50,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 336 transitions, 1415 flow [2025-02-06 09:15:50,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 336 transitions, 1351 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-02-06 09:15:50,082 INFO L231 Difference]: Finished difference. Result has 280 places, 328 transitions, 1187 flow [2025-02-06 09:15:50,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1187, PETRI_PLACES=280, PETRI_TRANSITIONS=328} [2025-02-06 09:15:50,084 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -15 predicate places. [2025-02-06 09:15:50,084 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 328 transitions, 1187 flow [2025-02-06 09:15:50,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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:15:50,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:50,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:15:50,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:15:50,085 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:50,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1563886253, now seen corresponding path program 1 times [2025-02-06 09:15:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:50,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562528118] [2025-02-06 09:15:50,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:50,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 09:15:50,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 09:15:50,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:50,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:15:50,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:50,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562528118] [2025-02-06 09:15:50,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562528118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:50,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:50,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:15:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907273856] [2025-02-06 09:15:50,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:50,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:15:50,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:50,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:15:50,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:15:50,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 305 [2025-02-06 09:15:50,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 328 transitions, 1187 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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:15:50,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:50,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 305 [2025-02-06 09:15:50,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:51,476 INFO L124 PetriNetUnfolderBase]: 1209/3460 cut-off events. [2025-02-06 09:15:51,476 INFO L125 PetriNetUnfolderBase]: For 4790/5018 co-relation queries the response was YES. [2025-02-06 09:15:51,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10167 conditions, 3460 events. 1209/3460 cut-off events. For 4790/5018 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 24895 event pairs, 352 based on Foata normal form. 10/3338 useless extension candidates. Maximal degree in co-relation 8769. Up to 1593 conditions per place. [2025-02-06 09:15:51,499 INFO L140 encePairwiseOnDemand]: 288/305 looper letters, 110 selfloop transitions, 39 changer transitions 37/373 dead transitions. [2025-02-06 09:15:51,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 373 transitions, 1883 flow [2025-02-06 09:15:51,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:15:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:15:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions. [2025-02-06 09:15:51,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289617486338798 [2025-02-06 09:15:51,502 INFO L175 Difference]: Start difference. First operand has 280 places, 328 transitions, 1187 flow. Second operand 6 states and 1517 transitions. [2025-02-06 09:15:51,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 373 transitions, 1883 flow [2025-02-06 09:15:51,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 373 transitions, 1851 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-02-06 09:15:51,513 INFO L231 Difference]: Finished difference. Result has 289 places, 328 transitions, 1574 flow [2025-02-06 09:15:51,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1574, PETRI_PLACES=289, PETRI_TRANSITIONS=328} [2025-02-06 09:15:51,514 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -6 predicate places. [2025-02-06 09:15:51,514 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 328 transitions, 1574 flow [2025-02-06 09:15:51,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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:15:51,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:51,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:15:51,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:15:51,515 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:51,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1623307407, now seen corresponding path program 1 times [2025-02-06 09:15:51,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:51,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396551923] [2025-02-06 09:15:51,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:51,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:51,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 09:15:51,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 09:15:51,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:51,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:15:51,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:51,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396551923] [2025-02-06 09:15:51,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396551923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:51,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:51,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:15:51,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77413418] [2025-02-06 09:15:51,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:51,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:15:51,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:51,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:15:51,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:15:51,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 305 [2025-02-06 09:15:51,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 328 transitions, 1574 flow. Second operand has 5 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 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:15:51,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:51,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 305 [2025-02-06 09:15:51,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:51,789 INFO L124 PetriNetUnfolderBase]: 167/614 cut-off events. [2025-02-06 09:15:51,790 INFO L125 PetriNetUnfolderBase]: For 1270/1332 co-relation queries the response was YES. [2025-02-06 09:15:51,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 614 events. 167/614 cut-off events. For 1270/1332 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3064 event pairs, 15 based on Foata normal form. 6/607 useless extension candidates. Maximal degree in co-relation 1612. Up to 179 conditions per place. [2025-02-06 09:15:51,793 INFO L140 encePairwiseOnDemand]: 300/305 looper letters, 43 selfloop transitions, 4 changer transitions 0/178 dead transitions. [2025-02-06 09:15:51,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 178 transitions, 702 flow [2025-02-06 09:15:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:15:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:15:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions. [2025-02-06 09:15:51,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8721311475409836 [2025-02-06 09:15:51,796 INFO L175 Difference]: Start difference. First operand has 289 places, 328 transitions, 1574 flow. Second operand 6 states and 1596 transitions. [2025-02-06 09:15:51,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 178 transitions, 702 flow [2025-02-06 09:15:51,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 178 transitions, 562 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-02-06 09:15:51,799 INFO L231 Difference]: Finished difference. Result has 176 places, 150 transitions, 348 flow [2025-02-06 09:15:51,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=176, PETRI_TRANSITIONS=150} [2025-02-06 09:15:51,800 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -119 predicate places. [2025-02-06 09:15:51,800 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 348 flow [2025-02-06 09:15:51,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 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:15:51,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:15:51,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:15:51,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:15:51,802 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-06 09:15:51,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:15:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash -544523988, now seen corresponding path program 1 times [2025-02-06 09:15:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:15:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170095625] [2025-02-06 09:15:51,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:15:51,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:15:51,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 09:15:51,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 09:15:51,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:15:51,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:15:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:15:51,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:15:51,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170095625] [2025-02-06 09:15:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170095625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:15:51,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:15:51,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:15:51,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079812617] [2025-02-06 09:15:51,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:15:51,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:15:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:15:51,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:15:51,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:15:51,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 305 [2025-02-06 09:15:51,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 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:15:51,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:15:51,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 305 [2025-02-06 09:15:51,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:15:51,905 INFO L124 PetriNetUnfolderBase]: 39/300 cut-off events. [2025-02-06 09:15:51,905 INFO L125 PetriNetUnfolderBase]: For 60/81 co-relation queries the response was YES. [2025-02-06 09:15:51,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 300 events. 39/300 cut-off events. For 60/81 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 932 event pairs, 23 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 503. Up to 76 conditions per place. [2025-02-06 09:15:51,906 INFO L140 encePairwiseOnDemand]: 303/305 looper letters, 0 selfloop transitions, 0 changer transitions 152/152 dead transitions. [2025-02-06 09:15:51,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 152 transitions, 394 flow [2025-02-06 09:15:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:15:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:15:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2025-02-06 09:15:51,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.892896174863388 [2025-02-06 09:15:51,908 INFO L175 Difference]: Start difference. First operand has 176 places, 150 transitions, 348 flow. Second operand 3 states and 817 transitions. [2025-02-06 09:15:51,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 152 transitions, 394 flow [2025-02-06 09:15:51,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 152 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:15:51,910 INFO L231 Difference]: Finished difference. Result has 173 places, 0 transitions, 0 flow [2025-02-06 09:15:51,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=173, PETRI_TRANSITIONS=0} [2025-02-06 09:15:51,910 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -122 predicate places. [2025-02-06 09:15:51,910 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 0 transitions, 0 flow [2025-02-06 09:15:51,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 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:15:51,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2025-02-06 09:15:51,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-02-06 09:15:51,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-02-06 09:15:51,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-02-06 09:15:51,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-02-06 09:15:51,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-02-06 09:15:51,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:15:51,916 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:15:51,920 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:15:51,920 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:15:51,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:15:51 BasicIcfg [2025-02-06 09:15:51,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:15:51,926 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:15:51,926 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:15:51,926 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:15:51,926 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:15:41" (3/4) ... [2025-02-06 09:15:51,927 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:15:51,930 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-02-06 09:15:51,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-02-06 09:15:51,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 09:15:51,937 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:15:51,937 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:15:52,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:15:52,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:15:52,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:15:52,008 INFO L158 Benchmark]: Toolchain (without parser) took 11128.77ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 111.7MB in the beginning and 265.7MB in the end (delta: -154.0MB). Peak memory consumption was 387.0MB. Max. memory is 16.1GB. [2025-02-06 09:15:52,009 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:15:52,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.99ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 81.0MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 09:15:52,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.64ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 77.2MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:15:52,009 INFO L158 Benchmark]: Boogie Preprocessor took 43.27ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 73.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:15:52,010 INFO L158 Benchmark]: IcfgBuilder took 577.64ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 102.8MB in the end (delta: -29.2MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2025-02-06 09:15:52,010 INFO L158 Benchmark]: TraceAbstraction took 10013.21ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 102.1MB in the beginning and 274.1MB in the end (delta: -172.1MB). Peak memory consumption was 362.0MB. Max. memory is 16.1GB. [2025-02-06 09:15:52,010 INFO L158 Benchmark]: Witness Printer took 82.18ms. Allocated memory is still 679.5MB. Free memory was 274.1MB in the beginning and 265.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:15:52,012 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.13ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.99ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 81.0MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.64ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 77.2MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.27ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 73.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 577.64ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 102.8MB in the end (delta: -29.2MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10013.21ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 102.1MB in the beginning and 274.1MB in the end (delta: -172.1MB). Peak memory consumption was 362.0MB. Max. memory is 16.1GB. * Witness Printer took 82.18ms. Allocated memory is still 679.5MB. Free memory was 274.1MB in the beginning and 265.7MB 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: 3923]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3924]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3925]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3926]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3931]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3933]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3942]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3964]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3943]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3934]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3965]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3960]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3966]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3967]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3904]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3908]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3911]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3914]: 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 4 procedures, 312 locations, 29 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: 9.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1642 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 901 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3559 IncrementalHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 135 mSDtfsCounter, 3559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1574occurred in iteration=13, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1251 ConstructedInterpolants, 0 QuantifiedInterpolants, 1989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 102/102 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 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:15:52,026 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