./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.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 ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:26:04,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:26:04,376 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:26:04,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:26:04,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:26:04,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:26:04,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:26:04,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:26:04,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:26:04,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:26:04,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:26:04,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:26:04,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:26:04,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:26:04,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:26:04,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:26:04,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:26:04,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:26:04,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:26:04,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:26:04,405 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 -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2025-02-06 09:26:04,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:26:04,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:26:04,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:26:04,657 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:26:04,657 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:26:04,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-02-06 09:26:05,806 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fa4abdab/3133f2784b1347ee815f0055a3071307/FLAG28c790c86 [2025-02-06 09:26:06,053 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:26:06,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-02-06 09:26:06,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fa4abdab/3133f2784b1347ee815f0055a3071307/FLAG28c790c86 [2025-02-06 09:26:06,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fa4abdab/3133f2784b1347ee815f0055a3071307 [2025-02-06 09:26:06,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:26:06,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:26:06,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:26:06,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:26:06,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:26:06,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc0aa8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06, skipping insertion in model container [2025-02-06 09:26:06,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:26:06,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:26:06,684 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:26:06,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:26:06,762 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:26:06,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06 WrapperNode [2025-02-06 09:26:06,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:26:06,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:26:06,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:26:06,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:26:06,768 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:26:06" (1/1) ... [2025-02-06 09:26:06,776 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:26:06" (1/1) ... [2025-02-06 09:26:06,792 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 196 [2025-02-06 09:26:06,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:26:06,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:26:06,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:26:06,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:26:06,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:26:06,817 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:26:06,817 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:26:06,817 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:26:06,818 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06" (1/1) ... [2025-02-06 09:26:06,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:26:06,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:06,842 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:26:06,845 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:26:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:26:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:26:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:26:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:26:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:26:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:26:06,863 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:26:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:26:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:26:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:26:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:26:06,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:26:06,864 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:26:06,969 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:26:06,970 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:26:07,185 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:26:07,185 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:26:07,254 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:26:07,254 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:26:07,281 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:26:07,282 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:26:07,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:26:07 BoogieIcfgContainer [2025-02-06 09:26:07,282 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:26:07,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:26:07,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:26:07,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:26:07,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:26:06" (1/3) ... [2025-02-06 09:26:07,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359c2386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:26:07, skipping insertion in model container [2025-02-06 09:26:07,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:06" (2/3) ... [2025-02-06 09:26:07,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359c2386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:26:07, skipping insertion in model container [2025-02-06 09:26:07,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:26:07" (3/3) ... [2025-02-06 09:26:07,288 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2025-02-06 09:26:07,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:26:07,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_60-invariant_racefree.i that has 2 procedures, 192 locations, 1 initial locations, 10 loop locations, and 13 error locations. [2025-02-06 09:26:07,302 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:26:07,364 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:26:07,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 214 transitions, 435 flow [2025-02-06 09:26:07,476 INFO L124 PetriNetUnfolderBase]: 32/314 cut-off events. [2025-02-06 09:26:07,478 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:26:07,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 314 events. 32/314 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1353 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 183. Up to 6 conditions per place. [2025-02-06 09:26:07,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 214 transitions, 435 flow [2025-02-06 09:26:07,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 214 transitions, 435 flow [2025-02-06 09:26:07,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:07,519 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;@553d1f5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:07,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-06 09:26:07,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:07,531 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2025-02-06 09:26:07,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:07,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:07,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:07,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-06 09:26:07,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:07,537 INFO L85 PathProgramCache]: Analyzing trace with hash 448505960, now seen corresponding path program 1 times [2025-02-06 09:26:07,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:07,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721984539] [2025-02-06 09:26:07,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:07,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:07,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:26:07,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:26:07,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:07,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:08,117 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:26:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:08,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721984539] [2025-02-06 09:26:08,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721984539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:08,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:08,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:08,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888845227] [2025-02-06 09:26:08,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:08,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:08,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:08,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:08,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:08,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 214 [2025-02-06 09:26:08,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 214 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 156.5) internal successors, (939), 6 states have internal predecessors, (939), 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:26:08,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:08,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 214 [2025-02-06 09:26:08,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:08,569 INFO L124 PetriNetUnfolderBase]: 203/1414 cut-off events. [2025-02-06 09:26:08,570 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:26:08,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 1414 events. 203/1414 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10035 event pairs, 136 based on Foata normal form. 331/1608 useless extension candidates. Maximal degree in co-relation 1719. Up to 344 conditions per place. [2025-02-06 09:26:08,586 INFO L140 encePairwiseOnDemand]: 188/214 looper letters, 67 selfloop transitions, 5 changer transitions 0/225 dead transitions. [2025-02-06 09:26:08,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 225 transitions, 601 flow [2025-02-06 09:26:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:26:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:26:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1063 transitions. [2025-02-06 09:26:08,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8278816199376947 [2025-02-06 09:26:08,610 INFO L175 Difference]: Start difference. First operand has 195 places, 214 transitions, 435 flow. Second operand 6 states and 1063 transitions. [2025-02-06 09:26:08,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 225 transitions, 601 flow [2025-02-06 09:26:08,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 225 transitions, 601 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:08,622 INFO L231 Difference]: Finished difference. Result has 195 places, 189 transitions, 395 flow [2025-02-06 09:26:08,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=195, PETRI_TRANSITIONS=189} [2025-02-06 09:26:08,629 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, 0 predicate places. [2025-02-06 09:26:08,629 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 189 transitions, 395 flow [2025-02-06 09:26:08,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.5) internal successors, (939), 6 states have internal predecessors, (939), 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:26:08,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:08,629 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] [2025-02-06 09:26:08,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:26:08,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-06 09:26:08,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1968921003, now seen corresponding path program 1 times [2025-02-06 09:26:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511053765] [2025-02-06 09:26:08,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:08,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:26:08,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:26:08,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:08,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:08,666 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:26:08,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511053765] [2025-02-06 09:26:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511053765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:08,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:08,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:08,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152081669] [2025-02-06 09:26:08,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:08,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:08,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:08,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:08,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 214 [2025-02-06 09:26:08,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 189 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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:26:08,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:08,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 214 [2025-02-06 09:26:08,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:08,827 INFO L124 PetriNetUnfolderBase]: 109/1133 cut-off events. [2025-02-06 09:26:08,827 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:26:08,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 1133 events. 109/1133 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7422 event pairs, 0 based on Foata normal form. 1/1030 useless extension candidates. Maximal degree in co-relation 1354. Up to 232 conditions per place. [2025-02-06 09:26:08,831 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 32 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-02-06 09:26:08,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 198 transitions, 481 flow [2025-02-06 09:26:08,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2025-02-06 09:26:08,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8348909657320872 [2025-02-06 09:26:08,834 INFO L175 Difference]: Start difference. First operand has 195 places, 189 transitions, 395 flow. Second operand 3 states and 536 transitions. [2025-02-06 09:26:08,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 198 transitions, 481 flow [2025-02-06 09:26:08,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 198 transitions, 471 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:26:08,840 INFO L231 Difference]: Finished difference. Result has 193 places, 189 transitions, 393 flow [2025-02-06 09:26:08,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=193, PETRI_TRANSITIONS=189} [2025-02-06 09:26:08,842 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -2 predicate places. [2025-02-06 09:26:08,842 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 189 transitions, 393 flow [2025-02-06 09:26:08,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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:26:08,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:08,842 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] [2025-02-06 09:26:08,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:26:08,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-06 09:26:08,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash 949364761, now seen corresponding path program 1 times [2025-02-06 09:26:08,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:08,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99900055] [2025-02-06 09:26:08,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:08,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 09:26:08,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 09:26:08,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:08,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:08,887 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:26:08,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99900055] [2025-02-06 09:26:08,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99900055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:08,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:08,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:26:08,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533628665] [2025-02-06 09:26:08,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:08,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:08,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:08,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:08,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:08,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 214 [2025-02-06 09:26:08,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 189 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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:26:08,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:08,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 214 [2025-02-06 09:26:08,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:09,150 INFO L124 PetriNetUnfolderBase]: 442/2690 cut-off events. [2025-02-06 09:26:09,151 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 09:26:09,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3675 conditions, 2690 events. 442/2690 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 21784 event pairs, 169 based on Foata normal form. 0/2438 useless extension candidates. Maximal degree in co-relation 3626. Up to 608 conditions per place. [2025-02-06 09:26:09,161 INFO L140 encePairwiseOnDemand]: 189/214 looper letters, 62 selfloop transitions, 18 changer transitions 0/225 dead transitions. [2025-02-06 09:26:09,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 225 transitions, 628 flow [2025-02-06 09:26:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2025-02-06 09:26:09,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8271028037383178 [2025-02-06 09:26:09,163 INFO L175 Difference]: Start difference. First operand has 193 places, 189 transitions, 393 flow. Second operand 3 states and 531 transitions. [2025-02-06 09:26:09,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 225 transitions, 628 flow [2025-02-06 09:26:09,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 225 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:09,166 INFO L231 Difference]: Finished difference. Result has 195 places, 207 transitions, 547 flow [2025-02-06 09:26:09,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=195, PETRI_TRANSITIONS=207} [2025-02-06 09:26:09,167 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, 0 predicate places. [2025-02-06 09:26:09,167 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 207 transitions, 547 flow [2025-02-06 09:26:09,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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:26:09,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:09,167 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:26:09,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:26:09,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-06 09:26:09,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:09,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1672545982, now seen corresponding path program 1 times [2025-02-06 09:26:09,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:09,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750126524] [2025-02-06 09:26:09,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:09,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:09,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:26:09,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:26:09,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:09,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:09,191 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:26:09,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:26:09,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:26:09,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:09,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:09,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:26:09,224 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:26:09,225 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-02-06 09:26:09,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-02-06 09:26:09,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-02-06 09:26:09,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-02-06 09:26:09,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-02-06 09:26:09,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-02-06 09:26:09,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-02-06 09:26:09,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-02-06 09:26:09,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:26:09,228 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:26:09,231 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:26:09,231 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:26:09,261 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:26:09,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 296 transitions, 608 flow [2025-02-06 09:26:09,313 INFO L124 PetriNetUnfolderBase]: 55/523 cut-off events. [2025-02-06 09:26:09,314 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:26:09,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 523 events. 55/523 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2469 event pairs, 0 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 316. Up to 9 conditions per place. [2025-02-06 09:26:09,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 296 transitions, 608 flow [2025-02-06 09:26:09,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 296 transitions, 608 flow [2025-02-06 09:26:09,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:09,321 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;@553d1f5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:09,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-06 09:26:09,328 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:09,328 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2025-02-06 09:26:09,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:09,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:09,328 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] [2025-02-06 09:26:09,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-06 09:26:09,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1938936976, now seen corresponding path program 1 times [2025-02-06 09:26:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:09,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902942302] [2025-02-06 09:26:09,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:09,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:26:09,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:26:09,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:09,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:09,576 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:26:09,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902942302] [2025-02-06 09:26:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902942302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:09,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:09,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:09,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315608351] [2025-02-06 09:26:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:09,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:09,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:09,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:09,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:09,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 296 [2025-02-06 09:26:09,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 296 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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:26:09,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:09,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 296 [2025-02-06 09:26:09,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:11,298 INFO L124 PetriNetUnfolderBase]: 4365/16523 cut-off events. [2025-02-06 09:26:11,298 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-02-06 09:26:11,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23537 conditions, 16523 events. 4365/16523 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 194352 event pairs, 468 based on Foata normal form. 5931/20999 useless extension candidates. Maximal degree in co-relation 2637. Up to 5257 conditions per place. [2025-02-06 09:26:11,439 INFO L140 encePairwiseOnDemand]: 260/296 looper letters, 114 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2025-02-06 09:26:11,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 331 transitions, 916 flow [2025-02-06 09:26:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:26:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:26:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1520 transitions. [2025-02-06 09:26:11,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8558558558558559 [2025-02-06 09:26:11,443 INFO L175 Difference]: Start difference. First operand has 267 places, 296 transitions, 608 flow. Second operand 6 states and 1520 transitions. [2025-02-06 09:26:11,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 331 transitions, 916 flow [2025-02-06 09:26:11,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 331 transitions, 916 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:11,450 INFO L231 Difference]: Finished difference. Result has 265 places, 259 transitions, 544 flow [2025-02-06 09:26:11,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=544, PETRI_PLACES=265, PETRI_TRANSITIONS=259} [2025-02-06 09:26:11,450 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, -2 predicate places. [2025-02-06 09:26:11,451 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 259 transitions, 544 flow [2025-02-06 09:26:11,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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:26:11,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:11,452 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] [2025-02-06 09:26:11,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:26:11,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-06 09:26:11,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash -478489987, now seen corresponding path program 1 times [2025-02-06 09:26:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:11,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903583081] [2025-02-06 09:26:11,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:11,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:26:11,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:26:11,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:11,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:11,492 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:26:11,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:11,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903583081] [2025-02-06 09:26:11,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903583081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:11,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:11,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:11,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444589138] [2025-02-06 09:26:11,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:11,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:11,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:11,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:11,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 296 [2025-02-06 09:26:11,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 259 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:26:11,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:11,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 296 [2025-02-06 09:26:11,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:12,781 INFO L124 PetriNetUnfolderBase]: 2529/13235 cut-off events. [2025-02-06 09:26:12,782 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-02-06 09:26:12,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17338 conditions, 13235 events. 2529/13235 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 156158 event pairs, 1098 based on Foata normal form. 1/11828 useless extension candidates. Maximal degree in co-relation 1858. Up to 3840 conditions per place. [2025-02-06 09:26:12,846 INFO L140 encePairwiseOnDemand]: 293/296 looper letters, 44 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-02-06 09:26:12,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 269 transitions, 658 flow [2025-02-06 09:26:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2025-02-06 09:26:12,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8198198198198198 [2025-02-06 09:26:12,848 INFO L175 Difference]: Start difference. First operand has 265 places, 259 transitions, 544 flow. Second operand 3 states and 728 transitions. [2025-02-06 09:26:12,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 269 transitions, 658 flow [2025-02-06 09:26:12,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 269 transitions, 646 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:26:12,854 INFO L231 Difference]: Finished difference. Result has 263 places, 260 transitions, 546 flow [2025-02-06 09:26:12,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=263, PETRI_TRANSITIONS=260} [2025-02-06 09:26:12,855 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, -4 predicate places. [2025-02-06 09:26:12,855 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 260 transitions, 546 flow [2025-02-06 09:26:12,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:26:12,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:12,856 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] [2025-02-06 09:26:12,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:26:12,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-06 09:26:12,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:12,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2121730319, now seen corresponding path program 1 times [2025-02-06 09:26:12,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:12,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225075155] [2025-02-06 09:26:12,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:12,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 09:26:12,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 09:26:12,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:12,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:12,891 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:26:12,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:12,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225075155] [2025-02-06 09:26:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225075155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:12,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:26:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115062050] [2025-02-06 09:26:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:12,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:12,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:12,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:12,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 296 [2025-02-06 09:26:12,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 260 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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:26:12,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:12,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 296 [2025-02-06 09:26:12,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:19,053 INFO L124 PetriNetUnfolderBase]: 26162/88209 cut-off events. [2025-02-06 09:26:19,053 INFO L125 PetriNetUnfolderBase]: For 550/550 co-relation queries the response was YES. [2025-02-06 09:26:19,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130493 conditions, 88209 events. 26162/88209 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 1637. Compared 1243234 event pairs, 10754 based on Foata normal form. 0/79067 useless extension candidates. Maximal degree in co-relation 130443. Up to 26496 conditions per place. [2025-02-06 09:26:19,490 INFO L140 encePairwiseOnDemand]: 257/296 looper letters, 98 selfloop transitions, 28 changer transitions 0/317 dead transitions. [2025-02-06 09:26:19,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 317 transitions, 923 flow [2025-02-06 09:26:19,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2025-02-06 09:26:19,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8096846846846847 [2025-02-06 09:26:19,493 INFO L175 Difference]: Start difference. First operand has 263 places, 260 transitions, 546 flow. Second operand 3 states and 719 transitions. [2025-02-06 09:26:19,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 317 transitions, 923 flow [2025-02-06 09:26:19,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 317 transitions, 921 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:26:19,500 INFO L231 Difference]: Finished difference. Result has 266 places, 288 transitions, 790 flow [2025-02-06 09:26:19,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=266, PETRI_TRANSITIONS=288} [2025-02-06 09:26:19,502 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, -1 predicate places. [2025-02-06 09:26:19,502 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 288 transitions, 790 flow [2025-02-06 09:26:19,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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:26:19,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:19,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:19,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:26:19,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-06 09:26:19,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1742552167, now seen corresponding path program 1 times [2025-02-06 09:26:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:19,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563842843] [2025-02-06 09:26:19,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:19,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:19,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 09:26:19,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 09:26:19,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:19,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:26:19,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:19,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563842843] [2025-02-06 09:26:19,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563842843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:19,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:19,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:19,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255262929] [2025-02-06 09:26:19,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:19,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:26:19,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:19,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:26:19,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:26:19,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 296 [2025-02-06 09:26:19,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 288 transitions, 790 flow. Second operand has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 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:26:19,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:19,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 296 [2025-02-06 09:26:19,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:25,157 INFO L124 PetriNetUnfolderBase]: 14897/71614 cut-off events. [2025-02-06 09:26:25,157 INFO L125 PetriNetUnfolderBase]: For 4986/5371 co-relation queries the response was YES. [2025-02-06 09:26:25,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106494 conditions, 71614 events. 14897/71614 cut-off events. For 4986/5371 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 1081037 event pairs, 4668 based on Foata normal form. 10/64832 useless extension candidates. Maximal degree in co-relation 100640. Up to 14701 conditions per place. [2025-02-06 09:26:25,546 INFO L140 encePairwiseOnDemand]: 291/296 looper letters, 81 selfloop transitions, 5 changer transitions 0/335 dead transitions. [2025-02-06 09:26:25,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 335 transitions, 1056 flow [2025-02-06 09:26:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:26:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:26:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1437 transitions. [2025-02-06 09:26:25,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8091216216216216 [2025-02-06 09:26:25,550 INFO L175 Difference]: Start difference. First operand has 266 places, 288 transitions, 790 flow. Second operand 6 states and 1437 transitions. [2025-02-06 09:26:25,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 335 transitions, 1056 flow [2025-02-06 09:26:25,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 335 transitions, 1000 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:25,603 INFO L231 Difference]: Finished difference. Result has 272 places, 290 transitions, 760 flow [2025-02-06 09:26:25,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=290} [2025-02-06 09:26:25,604 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 5 predicate places. [2025-02-06 09:26:25,605 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 290 transitions, 760 flow [2025-02-06 09:26:25,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 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:26:25,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:25,605 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] [2025-02-06 09:26:25,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:26:25,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-06 09:26:25,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1141429649, now seen corresponding path program 1 times [2025-02-06 09:26:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:25,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878936487] [2025-02-06 09:26:25,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:25,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:26:25,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:26:25,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:25,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:26:25,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:25,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878936487] [2025-02-06 09:26:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878936487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:25,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:25,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:25,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158871124] [2025-02-06 09:26:25,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:25,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:25,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:25,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:25,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 296 [2025-02-06 09:26:25,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 290 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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:26:25,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:25,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 296 [2025-02-06 09:26:25,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:33,178 INFO L124 PetriNetUnfolderBase]: 21503/95484 cut-off events. [2025-02-06 09:26:33,178 INFO L125 PetriNetUnfolderBase]: For 803/847 co-relation queries the response was YES. [2025-02-06 09:26:33,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137824 conditions, 95484 events. 21503/95484 cut-off events. For 803/847 co-relation queries the response was YES. Maximal size of possible extension queue 2099. Compared 1496913 event pairs, 10089 based on Foata normal form. 0/85326 useless extension candidates. Maximal degree in co-relation 137686. Up to 17323 conditions per place. [2025-02-06 09:26:33,880 INFO L140 encePairwiseOnDemand]: 285/296 looper letters, 65 selfloop transitions, 9 changer transitions 0/321 dead transitions. [2025-02-06 09:26:33,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 321 transitions, 972 flow [2025-02-06 09:26:33,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-02-06 09:26:33,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355855855855856 [2025-02-06 09:26:33,882 INFO L175 Difference]: Start difference. First operand has 272 places, 290 transitions, 760 flow. Second operand 3 states and 742 transitions. [2025-02-06 09:26:33,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 321 transitions, 972 flow [2025-02-06 09:26:33,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 321 transitions, 966 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:33,890 INFO L231 Difference]: Finished difference. Result has 273 places, 295 transitions, 814 flow [2025-02-06 09:26:33,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=273, PETRI_TRANSITIONS=295} [2025-02-06 09:26:33,891 INFO L279 CegarLoopForPetriNet]: 267 programPoint places, 6 predicate places. [2025-02-06 09:26:33,891 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 295 transitions, 814 flow [2025-02-06 09:26:33,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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:26:33,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:33,892 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 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:26:33,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:26:33,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-02-06 09:26:33,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:33,892 INFO L85 PathProgramCache]: Analyzing trace with hash 712701683, now seen corresponding path program 1 times [2025-02-06 09:26:33,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:33,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994852985] [2025-02-06 09:26:33,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:33,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:33,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:26:33,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:26:33,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:33,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:33,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:26:33,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:26:33,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:26:33,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:33,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:33,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:26:33,923 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:26:33,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2025-02-06 09:26:33,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2025-02-06 09:26:33,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-02-06 09:26:33,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-02-06 09:26:33,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-02-06 09:26:33,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-02-06 09:26:33,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-02-06 09:26:33,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-02-06 09:26:33,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-02-06 09:26:33,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-02-06 09:26:33,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-02-06 09:26:33,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-02-06 09:26:33,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:26:33,925 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:26:33,925 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:26:33,925 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:26:33,955 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:26:33,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 339 places, 378 transitions, 783 flow [2025-02-06 09:26:34,025 INFO L124 PetriNetUnfolderBase]: 81/775 cut-off events. [2025-02-06 09:26:34,025 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 09:26:34,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 775 events. 81/775 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3818 event pairs, 1 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 531. Up to 12 conditions per place. [2025-02-06 09:26:34,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 339 places, 378 transitions, 783 flow [2025-02-06 09:26:34,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 339 places, 378 transitions, 783 flow [2025-02-06 09:26:34,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:34,045 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;@553d1f5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:34,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-06 09:26:34,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:34,048 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2025-02-06 09:26:34,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:34,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:34,048 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] [2025-02-06 09:26:34,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-06 09:26:34,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash -975070518, now seen corresponding path program 1 times [2025-02-06 09:26:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490360498] [2025-02-06 09:26:34,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:34,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:34,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:26:34,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:26:34,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:34,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:34,228 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:26:34,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:34,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490360498] [2025-02-06 09:26:34,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490360498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:34,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:34,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:34,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671686815] [2025-02-06 09:26:34,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:34,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:34,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:34,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:34,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:34,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 378 [2025-02-06 09:26:34,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 378 transitions, 783 flow. Second operand has 6 states, 6 states have (on average 276.5) internal successors, (1659), 6 states have internal predecessors, (1659), 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:26:34,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:34,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 378 [2025-02-06 09:26:34,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand