./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/airline-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/airline-15.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 c250d04a54594f141e4a6230ba64a939d316d8b15028517201aca3da084476d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:41:24,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:41:24,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:41:24,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:41:24,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:41:24,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:41:24,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:41:24,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:41:24,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:41:24,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:41:24,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:41:24,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:41:24,456 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:41:24,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:41:24,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:41:24,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:41:24,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:41:24,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:41:24,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:41:24,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:41:24,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:41:24,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:41:24,457 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:41:24,457 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:41:24,457 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:41:24,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:41:24,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:41:24,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:41:24,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:41:24,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:41:24,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:41:24,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:41:24,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:41:24,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:41:24,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:41:24,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:41:24,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:41:24,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:41:24,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:41:24,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:41:24,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:41:24,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:41:24,460 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 -> c250d04a54594f141e4a6230ba64a939d316d8b15028517201aca3da084476d7 [2025-02-08 05:41:24,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:41:24,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:41:24,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:41:24,785 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:41:24,785 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:41:24,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/airline-15.i [2025-02-08 05:41:26,149 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81fa2b9e5/9d83cfc6ae64401fa6025c8dee958b8f/FLAG104ecb2fd [2025-02-08 05:41:26,481 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:41:26,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/airline-15.i [2025-02-08 05:41:26,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81fa2b9e5/9d83cfc6ae64401fa6025c8dee958b8f/FLAG104ecb2fd [2025-02-08 05:41:26,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81fa2b9e5/9d83cfc6ae64401fa6025c8dee958b8f [2025-02-08 05:41:26,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:41:26,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:41:26,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:41:26,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:41:26,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:41:26,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eef1065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26, skipping insertion in model container [2025-02-08 05:41:26,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:41:26,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:41:26,828 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:41:26,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:41:26,899 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:41:26,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26 WrapperNode [2025-02-08 05:41:26,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:41:26,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:41:26,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:41:26,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:41:26,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,939 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2025-02-08 05:41:26,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:41:26,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:41:26,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:41:26,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:41:26,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,957 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:41:26,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:41:26,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:41:26,963 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:41:26,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (1/1) ... [2025-02-08 05:41:26,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:41:26,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:41:26,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:41:27,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:41:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:41:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:41:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:41:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:41:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:41:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2025-02-08 05:41:27,024 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2025-02-08 05:41:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:41:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:41:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:41:27,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:41:27,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:41:27,026 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:41:27,134 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:41:27,136 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:41:27,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: havoc main_~#salethreads~0#1.base, main_~#salethreads~0#1.offset; [2025-02-08 05:41:27,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: SUMMARY for call ULTIMATE.dealloc(main_~#salethreads~0#1.base, main_~#salethreads~0#1.offset); srcloc: null [2025-02-08 05:41:27,391 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:41:27,391 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:41:27,446 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:41:27,447 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:41:27,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:27 BoogieIcfgContainer [2025-02-08 05:41:27,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:41:27,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:41:27,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:41:27,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:41:27,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:41:26" (1/3) ... [2025-02-08 05:41:27,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5408cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:41:27, skipping insertion in model container [2025-02-08 05:41:27,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:26" (2/3) ... [2025-02-08 05:41:27,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5408cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:41:27, skipping insertion in model container [2025-02-08 05:41:27,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:27" (3/3) ... [2025-02-08 05:41:27,459 INFO L128 eAbstractionObserver]: Analyzing ICFG airline-15.i [2025-02-08 05:41:27,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:41:27,475 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG airline-15.i that has 2 procedures, 92 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-02-08 05:41:27,476 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:41:27,536 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:41:27,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 97 transitions, 201 flow [2025-02-08 05:41:27,636 INFO L124 PetriNetUnfolderBase]: 7/140 cut-off events. [2025-02-08 05:41:27,638 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:41:27,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 140 events. 7/140 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 297 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2025-02-08 05:41:27,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 97 transitions, 201 flow [2025-02-08 05:41:27,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 97 transitions, 201 flow [2025-02-08 05:41:27,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:41:27,669 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;@98d9649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:41:27,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 05:41:27,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:41:27,679 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-02-08 05:41:27,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:41:27,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:27,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:27,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:41:27,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash 215893975, now seen corresponding path program 1 times [2025-02-08 05:41:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:27,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688647375] [2025-02-08 05:41:27,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:27,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:27,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 05:41:27,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 05:41:27,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:27,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:27,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688647375] [2025-02-08 05:41:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688647375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:27,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:41:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579213443] [2025-02-08 05:41:27,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:27,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:41:27,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:27,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:41:27,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:41:27,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 97 [2025-02-08 05:41:27,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 97 transitions, 201 flow. Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:27,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:27,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 97 [2025-02-08 05:41:27,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:27,966 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2025-02-08 05:41:27,967 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-02-08 05:41:27,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 3/127 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs, 0 based on Foata normal form. 4/115 useless extension candidates. Maximal degree in co-relation 64. Up to 8 conditions per place. [2025-02-08 05:41:27,973 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 7 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2025-02-08 05:41:27,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 197 flow [2025-02-08 05:41:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:41:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:41:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 178 transitions. [2025-02-08 05:41:27,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9175257731958762 [2025-02-08 05:41:27,992 INFO L175 Difference]: Start difference. First operand has 95 places, 97 transitions, 201 flow. Second operand 2 states and 178 transitions. [2025-02-08 05:41:27,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 197 flow [2025-02-08 05:41:27,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:28,005 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 183 flow [2025-02-08 05:41:28,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=183, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2025-02-08 05:41:28,012 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2025-02-08 05:41:28,012 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 183 flow [2025-02-08 05:41:28,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:28,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:28,014 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] [2025-02-08 05:41:28,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:41:28,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:41:28,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1511869188, now seen corresponding path program 1 times [2025-02-08 05:41:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:28,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489527071] [2025-02-08 05:41:28,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:28,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:41:28,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:41:28,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:28,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:28,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:28,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489527071] [2025-02-08 05:41:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489527071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:28,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:28,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:41:28,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376035176] [2025-02-08 05:41:28,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:28,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:28,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:28,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:28,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:28,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2025-02-08 05:41:28,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:28,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:28,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2025-02-08 05:41:28,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:28,250 INFO L124 PetriNetUnfolderBase]: 10/174 cut-off events. [2025-02-08 05:41:28,252 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:41:28,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 174 events. 10/174 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 458 event pairs, 0 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 203. Up to 23 conditions per place. [2025-02-08 05:41:28,254 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 13 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-02-08 05:41:28,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 217 flow [2025-02-08 05:41:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2025-02-08 05:41:28,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384879725085911 [2025-02-08 05:41:28,260 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 3 states and 244 transitions. [2025-02-08 05:41:28,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 217 flow [2025-02-08 05:41:28,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:28,263 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 191 flow [2025-02-08 05:41:28,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-02-08 05:41:28,264 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2025-02-08 05:41:28,264 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 191 flow [2025-02-08 05:41:28,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:28,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:28,265 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] [2025-02-08 05:41:28,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:41:28,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:41:28,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1790510325, now seen corresponding path program 1 times [2025-02-08 05:41:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:28,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634146407] [2025-02-08 05:41:28,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:28,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:28,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:41:28,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:41:28,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:28,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634146407] [2025-02-08 05:41:28,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634146407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:28,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:28,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:28,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467308668] [2025-02-08 05:41:28,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:28,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:41:28,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:28,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:41:28,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:41:28,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 97 [2025-02-08 05:41:28,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:28,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:28,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 97 [2025-02-08 05:41:28,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:29,036 INFO L124 PetriNetUnfolderBase]: 33/198 cut-off events. [2025-02-08 05:41:29,037 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:41:29,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 198 events. 33/198 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 657 event pairs, 9 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 292. Up to 56 conditions per place. [2025-02-08 05:41:29,039 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 28 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2025-02-08 05:41:29,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 271 flow [2025-02-08 05:41:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2025-02-08 05:41:29,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7079037800687286 [2025-02-08 05:41:29,044 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 191 flow. Second operand 6 states and 412 transitions. [2025-02-08 05:41:29,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 271 flow [2025-02-08 05:41:29,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 95 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:29,048 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 195 flow [2025-02-08 05:41:29,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2025-02-08 05:41:29,050 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2025-02-08 05:41:29,050 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 195 flow [2025-02-08 05:41:29,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:29,051 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] [2025-02-08 05:41:29,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:41:29,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:41:29,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1400639230, now seen corresponding path program 1 times [2025-02-08 05:41:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:29,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001002327] [2025-02-08 05:41:29,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:29,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:29,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:41:29,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:41:29,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:29,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:29,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001002327] [2025-02-08 05:41:29,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001002327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:29,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:29,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:29,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220258234] [2025-02-08 05:41:29,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:29,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:29,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:29,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:29,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:29,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 97 [2025-02-08 05:41:29,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:29,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 97 [2025-02-08 05:41:29,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:29,146 INFO L124 PetriNetUnfolderBase]: 1/154 cut-off events. [2025-02-08 05:41:29,147 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-02-08 05:41:29,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 154 events. 1/154 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 301 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 179. Up to 7 conditions per place. [2025-02-08 05:41:29,149 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 8 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-02-08 05:41:29,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 87 transitions, 218 flow [2025-02-08 05:41:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-02-08 05:41:29,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.852233676975945 [2025-02-08 05:41:29,150 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 195 flow. Second operand 3 states and 248 transitions. [2025-02-08 05:41:29,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 87 transitions, 218 flow [2025-02-08 05:41:29,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 87 transitions, 208 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:41:29,153 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 187 flow [2025-02-08 05:41:29,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2025-02-08 05:41:29,154 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2025-02-08 05:41:29,154 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 187 flow [2025-02-08 05:41:29,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:29,154 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] [2025-02-08 05:41:29,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:41:29,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:41:29,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash -835797792, now seen corresponding path program 1 times [2025-02-08 05:41:29,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:29,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820843492] [2025-02-08 05:41:29,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:29,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:29,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:41:29,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:41:29,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:29,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820843492] [2025-02-08 05:41:29,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820843492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:29,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:29,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18864299] [2025-02-08 05:41:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:29,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:29,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:29,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:29,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:29,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2025-02-08 05:41:29,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:29,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2025-02-08 05:41:29,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:29,248 INFO L124 PetriNetUnfolderBase]: 8/228 cut-off events. [2025-02-08 05:41:29,249 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES. [2025-02-08 05:41:29,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 228 events. 8/228 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 819 event pairs, 4 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 272. Up to 25 conditions per place. [2025-02-08 05:41:29,252 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 12 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2025-02-08 05:41:29,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 228 flow [2025-02-08 05:41:29,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2025-02-08 05:41:29,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.845360824742268 [2025-02-08 05:41:29,254 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 187 flow. Second operand 3 states and 246 transitions. [2025-02-08 05:41:29,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 228 flow [2025-02-08 05:41:29,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:29,256 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 211 flow [2025-02-08 05:41:29,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2025-02-08 05:41:29,257 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2025-02-08 05:41:29,259 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 211 flow [2025-02-08 05:41:29,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:29,259 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] [2025-02-08 05:41:29,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:41:29,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:41:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash 180242342, now seen corresponding path program 1 times [2025-02-08 05:41:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:29,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921564828] [2025-02-08 05:41:29,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:29,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:41:29,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:41:29,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:29,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:41:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921564828] [2025-02-08 05:41:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921564828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:29,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:29,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:29,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873867837] [2025-02-08 05:41:29,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:29,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:41:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:29,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:41:29,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:41:29,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 97 [2025-02-08 05:41:29,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:29,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 97 [2025-02-08 05:41:29,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:29,485 INFO L124 PetriNetUnfolderBase]: 7/99 cut-off events. [2025-02-08 05:41:29,485 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:41:29,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 99 events. 7/99 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 0 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2025-02-08 05:41:29,486 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 13 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-02-08 05:41:29,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 176 flow [2025-02-08 05:41:29,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2025-02-08 05:41:29,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7938144329896907 [2025-02-08 05:41:29,488 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 211 flow. Second operand 6 states and 462 transitions. [2025-02-08 05:41:29,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 176 flow [2025-02-08 05:41:29,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 154 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:41:29,490 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 116 flow [2025-02-08 05:41:29,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2025-02-08 05:41:29,490 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -36 predicate places. [2025-02-08 05:41:29,492 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 116 flow [2025-02-08 05:41:29,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:29,493 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] [2025-02-08 05:41:29,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:41:29,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-02-08 05:41:29,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1603252234, now seen corresponding path program 1 times [2025-02-08 05:41:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:29,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505255336] [2025-02-08 05:41:29,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:29,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:41:29,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:41:29,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:29,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:41:29,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:41:29,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:41:29,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:41:29,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:29,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:41:29,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:41:29,563 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:41:29,564 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-08 05:41:29,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-02-08 05:41:29,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-02-08 05:41:29,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-02-08 05:41:29,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-02-08 05:41:29,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-02-08 05:41:29,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-02-08 05:41:29,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-02-08 05:41:29,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-02-08 05:41:29,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-02-08 05:41:29,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-02-08 05:41:29,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-02-08 05:41:29,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-02-08 05:41:29,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-02-08 05:41:29,567 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-02-08 05:41:29,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:41:29,568 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:29,570 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:41:29,570 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:41:29,585 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:41:29,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 118 transitions, 252 flow [2025-02-08 05:41:29,613 INFO L124 PetriNetUnfolderBase]: 15/249 cut-off events. [2025-02-08 05:41:29,613 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:29,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 249 events. 15/249 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 597 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 142. Up to 8 conditions per place. [2025-02-08 05:41:29,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 118 transitions, 252 flow [2025-02-08 05:41:29,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 118 transitions, 252 flow [2025-02-08 05:41:29,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:41:29,618 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;@98d9649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:41:29,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 05:41:29,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:41:29,621 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-02-08 05:41:29,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:41:29,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:29,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:29,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:41:29,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1333035561, now seen corresponding path program 1 times [2025-02-08 05:41:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523455654] [2025-02-08 05:41:29,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:29,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 05:41:29,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 05:41:29,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:29,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:29,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523455654] [2025-02-08 05:41:29,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523455654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:29,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:41:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350483879] [2025-02-08 05:41:29,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:29,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:41:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:29,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:41:29,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:41:29,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 118 [2025-02-08 05:41:29,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 252 flow. Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:29,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 118 [2025-02-08 05:41:29,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:29,684 INFO L124 PetriNetUnfolderBase]: 19/254 cut-off events. [2025-02-08 05:41:29,684 INFO L125 PetriNetUnfolderBase]: For 35/41 co-relation queries the response was YES. [2025-02-08 05:41:29,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 254 events. 19/254 cut-off events. For 35/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 749 event pairs, 4 based on Foata normal form. 10/230 useless extension candidates. Maximal degree in co-relation 144. Up to 30 conditions per place. [2025-02-08 05:41:29,686 INFO L140 encePairwiseOnDemand]: 109/118 looper letters, 11 selfloop transitions, 0 changer transitions 0/107 dead transitions. [2025-02-08 05:41:29,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 252 flow [2025-02-08 05:41:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:41:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:41:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 214 transitions. [2025-02-08 05:41:29,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9067796610169492 [2025-02-08 05:41:29,688 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 252 flow. Second operand 2 states and 214 transitions. [2025-02-08 05:41:29,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 252 flow [2025-02-08 05:41:29,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 107 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:29,690 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 230 flow [2025-02-08 05:41:29,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=230, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2025-02-08 05:41:29,691 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -8 predicate places. [2025-02-08 05:41:29,691 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 230 flow [2025-02-08 05:41:29,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:29,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:29,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:41:29,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:41:29,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:29,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1738156868, now seen corresponding path program 1 times [2025-02-08 05:41:29,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:29,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051896507] [2025-02-08 05:41:29,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:29,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:29,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:41:29,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:41:29,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:29,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:29,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:29,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051896507] [2025-02-08 05:41:29,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051896507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:29,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:29,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:41:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565891166] [2025-02-08 05:41:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:29,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:29,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:29,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:29,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:29,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 118 [2025-02-08 05:41:29,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:29,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 118 [2025-02-08 05:41:29,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:29,837 INFO L124 PetriNetUnfolderBase]: 60/451 cut-off events. [2025-02-08 05:41:29,837 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:41:29,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 451 events. 60/451 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2057 event pairs, 24 based on Foata normal form. 1/395 useless extension candidates. Maximal degree in co-relation 568. Up to 97 conditions per place. [2025-02-08 05:41:29,840 INFO L140 encePairwiseOnDemand]: 115/118 looper letters, 18 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-02-08 05:41:29,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 110 transitions, 276 flow [2025-02-08 05:41:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2025-02-08 05:41:29,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8305084745762712 [2025-02-08 05:41:29,841 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 230 flow. Second operand 3 states and 294 transitions. [2025-02-08 05:41:29,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 110 transitions, 276 flow [2025-02-08 05:41:29,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:29,843 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 242 flow [2025-02-08 05:41:29,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2025-02-08 05:41:29,844 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2025-02-08 05:41:29,844 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 242 flow [2025-02-08 05:41:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:29,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:29,845 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] [2025-02-08 05:41:29,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:41:29,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:41:29,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash -741959957, now seen corresponding path program 1 times [2025-02-08 05:41:29,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:29,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354508113] [2025-02-08 05:41:29,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:29,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:29,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:41:29,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:41:29,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:29,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:30,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354508113] [2025-02-08 05:41:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354508113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:30,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:30,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:30,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292027645] [2025-02-08 05:41:30,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:30,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:41:30,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:30,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:41:30,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:41:30,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 118 [2025-02-08 05:41:30,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:30,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:30,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 118 [2025-02-08 05:41:30,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:30,411 INFO L124 PetriNetUnfolderBase]: 185/628 cut-off events. [2025-02-08 05:41:30,412 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-08 05:41:30,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 628 events. 185/628 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3484 event pairs, 55 based on Foata normal form. 0/568 useless extension candidates. Maximal degree in co-relation 974. Up to 214 conditions per place. [2025-02-08 05:41:30,417 INFO L140 encePairwiseOnDemand]: 112/118 looper letters, 41 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-02-08 05:41:30,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 123 transitions, 364 flow [2025-02-08 05:41:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2025-02-08 05:41:30,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7259887005649718 [2025-02-08 05:41:30,420 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 242 flow. Second operand 6 states and 514 transitions. [2025-02-08 05:41:30,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 123 transitions, 364 flow [2025-02-08 05:41:30,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:30,423 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 248 flow [2025-02-08 05:41:30,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2025-02-08 05:41:30,424 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -2 predicate places. [2025-02-08 05:41:30,424 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 248 flow [2025-02-08 05:41:30,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:30,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:30,425 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] [2025-02-08 05:41:30,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:41:30,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:41:30,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -802445179, now seen corresponding path program 1 times [2025-02-08 05:41:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534405145] [2025-02-08 05:41:30,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:30,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:41:30,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:41:30,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:30,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534405145] [2025-02-08 05:41:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534405145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:30,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:30,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:30,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199327855] [2025-02-08 05:41:30,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:30,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:30,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:30,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:30,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:30,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 118 [2025-02-08 05:41:30,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:30,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:30,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 118 [2025-02-08 05:41:30,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:30,632 INFO L124 PetriNetUnfolderBase]: 60/772 cut-off events. [2025-02-08 05:41:30,633 INFO L125 PetriNetUnfolderBase]: For 122/386 co-relation queries the response was YES. [2025-02-08 05:41:30,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 772 events. 60/772 cut-off events. For 122/386 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5044 event pairs, 9 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 951. Up to 62 conditions per place. [2025-02-08 05:41:30,639 INFO L140 encePairwiseOnDemand]: 110/118 looper letters, 22 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-02-08 05:41:30,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 337 flow [2025-02-08 05:41:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2025-02-08 05:41:30,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8559322033898306 [2025-02-08 05:41:30,641 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 248 flow. Second operand 3 states and 303 transitions. [2025-02-08 05:41:30,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 118 transitions, 337 flow [2025-02-08 05:41:30,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 327 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:41:30,644 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 290 flow [2025-02-08 05:41:30,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-02-08 05:41:30,645 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2025-02-08 05:41:30,645 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 290 flow [2025-02-08 05:41:30,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:30,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:30,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:30,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:41:30,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:41:30,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:30,646 INFO L85 PathProgramCache]: Analyzing trace with hash 143981619, now seen corresponding path program 1 times [2025-02-08 05:41:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:30,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693668394] [2025-02-08 05:41:30,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:30,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:41:30,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:41:30,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:30,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:30,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:30,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693668394] [2025-02-08 05:41:30,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693668394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:30,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:30,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63500294] [2025-02-08 05:41:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:30,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:30,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:30,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:30,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:30,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 118 [2025-02-08 05:41:30,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:30,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:30,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 118 [2025-02-08 05:41:30,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:30,956 INFO L124 PetriNetUnfolderBase]: 273/1920 cut-off events. [2025-02-08 05:41:30,956 INFO L125 PetriNetUnfolderBase]: For 374/820 co-relation queries the response was YES. [2025-02-08 05:41:30,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1920 events. 273/1920 cut-off events. For 374/820 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16747 event pairs, 93 based on Foata normal form. 1/1652 useless extension candidates. Maximal degree in co-relation 2702. Up to 395 conditions per place. [2025-02-08 05:41:30,969 INFO L140 encePairwiseOnDemand]: 107/118 looper letters, 27 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2025-02-08 05:41:30,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 126 transitions, 405 flow [2025-02-08 05:41:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2025-02-08 05:41:30,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.847457627118644 [2025-02-08 05:41:30,971 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 290 flow. Second operand 3 states and 300 transitions. [2025-02-08 05:41:30,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 126 transitions, 405 flow [2025-02-08 05:41:30,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 126 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:30,979 INFO L231 Difference]: Finished difference. Result has 114 places, 121 transitions, 348 flow [2025-02-08 05:41:30,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=114, PETRI_TRANSITIONS=121} [2025-02-08 05:41:30,980 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -1 predicate places. [2025-02-08 05:41:30,981 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 121 transitions, 348 flow [2025-02-08 05:41:30,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:30,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:30,982 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] [2025-02-08 05:41:30,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:41:30,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:41:30,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1859574535, now seen corresponding path program 1 times [2025-02-08 05:41:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:30,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944747928] [2025-02-08 05:41:30,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:30,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:41:31,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:41:31,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:31,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:41:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:31,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944747928] [2025-02-08 05:41:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944747928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:31,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:31,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:31,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143351411] [2025-02-08 05:41:31,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:31,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:41:31,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:31,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:41:31,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:41:31,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 118 [2025-02-08 05:41:31,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 348 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:31,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:31,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 118 [2025-02-08 05:41:31,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:31,459 INFO L124 PetriNetUnfolderBase]: 428/2871 cut-off events. [2025-02-08 05:41:31,459 INFO L125 PetriNetUnfolderBase]: For 839/949 co-relation queries the response was YES. [2025-02-08 05:41:31,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4420 conditions, 2871 events. 428/2871 cut-off events. For 839/949 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 28105 event pairs, 145 based on Foata normal form. 19/2535 useless extension candidates. Maximal degree in co-relation 4411. Up to 458 conditions per place. [2025-02-08 05:41:31,481 INFO L140 encePairwiseOnDemand]: 113/118 looper letters, 35 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-02-08 05:41:31,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 137 transitions, 498 flow [2025-02-08 05:41:31,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2025-02-08 05:41:31,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008474576271186 [2025-02-08 05:41:31,484 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 348 flow. Second operand 6 states and 567 transitions. [2025-02-08 05:41:31,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 137 transitions, 498 flow [2025-02-08 05:41:31,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 137 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:31,491 INFO L231 Difference]: Finished difference. Result has 120 places, 123 transitions, 358 flow [2025-02-08 05:41:31,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=120, PETRI_TRANSITIONS=123} [2025-02-08 05:41:31,492 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 5 predicate places. [2025-02-08 05:41:31,492 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 123 transitions, 358 flow [2025-02-08 05:41:31,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:31,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:31,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:31,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:41:31,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:41:31,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:31,494 INFO L85 PathProgramCache]: Analyzing trace with hash 94185882, now seen corresponding path program 1 times [2025-02-08 05:41:31,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:31,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104969512] [2025-02-08 05:41:31,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:31,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:41:31,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:41:31,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:31,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:41:31,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104969512] [2025-02-08 05:41:31,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104969512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:31,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:31,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:41:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532729493] [2025-02-08 05:41:31,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:41:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:31,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:41:31,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:41:31,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 118 [2025-02-08 05:41:31,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 123 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:31,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:31,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 118 [2025-02-08 05:41:31,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:31,871 INFO L124 PetriNetUnfolderBase]: 224/2215 cut-off events. [2025-02-08 05:41:31,871 INFO L125 PetriNetUnfolderBase]: For 304/598 co-relation queries the response was YES. [2025-02-08 05:41:31,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 2215 events. 224/2215 cut-off events. For 304/598 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 21417 event pairs, 65 based on Foata normal form. 33/1998 useless extension candidates. Maximal degree in co-relation 3025. Up to 283 conditions per place. [2025-02-08 05:41:31,884 INFO L140 encePairwiseOnDemand]: 112/118 looper letters, 30 selfloop transitions, 6 changer transitions 0/138 dead transitions. [2025-02-08 05:41:31,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 138 transitions, 499 flow [2025-02-08 05:41:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:41:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:41:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2025-02-08 05:41:31,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457627118644068 [2025-02-08 05:41:31,886 INFO L175 Difference]: Start difference. First operand has 120 places, 123 transitions, 358 flow. Second operand 5 states and 499 transitions. [2025-02-08 05:41:31,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 138 transitions, 499 flow [2025-02-08 05:41:31,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 138 transitions, 493 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:31,890 INFO L231 Difference]: Finished difference. Result has 124 places, 124 transitions, 387 flow [2025-02-08 05:41:31,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=124, PETRI_TRANSITIONS=124} [2025-02-08 05:41:31,891 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 9 predicate places. [2025-02-08 05:41:31,891 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 124 transitions, 387 flow [2025-02-08 05:41:31,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:31,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:31,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:31,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:41:31,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:41:31,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:31,892 INFO L85 PathProgramCache]: Analyzing trace with hash 200560534, now seen corresponding path program 1 times [2025-02-08 05:41:31,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:31,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581143476] [2025-02-08 05:41:31,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:31,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:31,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:41:31,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:41:31,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:31,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:41:31,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:31,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581143476] [2025-02-08 05:41:31,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581143476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:31,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:31,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:41:31,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658748317] [2025-02-08 05:41:31,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:31,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:41:31,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:31,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:41:31,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:41:31,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 118 [2025-02-08 05:41:31,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 124 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:31,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:31,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 118 [2025-02-08 05:41:31,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:32,235 INFO L124 PetriNetUnfolderBase]: 204/2065 cut-off events. [2025-02-08 05:41:32,235 INFO L125 PetriNetUnfolderBase]: For 544/718 co-relation queries the response was YES. [2025-02-08 05:41:32,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3047 conditions, 2065 events. 204/2065 cut-off events. For 544/718 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19644 event pairs, 61 based on Foata normal form. 33/1881 useless extension candidates. Maximal degree in co-relation 3032. Up to 257 conditions per place. [2025-02-08 05:41:32,245 INFO L140 encePairwiseOnDemand]: 112/118 looper letters, 26 selfloop transitions, 7 changer transitions 0/135 dead transitions. [2025-02-08 05:41:32,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 135 transitions, 510 flow [2025-02-08 05:41:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:41:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:41:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2025-02-08 05:41:32,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8389830508474576 [2025-02-08 05:41:32,247 INFO L175 Difference]: Start difference. First operand has 124 places, 124 transitions, 387 flow. Second operand 5 states and 495 transitions. [2025-02-08 05:41:32,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 135 transitions, 510 flow [2025-02-08 05:41:32,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 135 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:32,251 INFO L231 Difference]: Finished difference. Result has 129 places, 125 transitions, 421 flow [2025-02-08 05:41:32,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=421, PETRI_PLACES=129, PETRI_TRANSITIONS=125} [2025-02-08 05:41:32,252 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 14 predicate places. [2025-02-08 05:41:32,252 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 421 flow [2025-02-08 05:41:32,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:32,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:32,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:32,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:41:32,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:41:32,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash 910238174, now seen corresponding path program 1 times [2025-02-08 05:41:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:32,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161495036] [2025-02-08 05:41:32,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:32,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:32,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:41:32,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:41:32,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:32,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:41:32,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:41:32,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:41:32,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:41:32,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:32,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:41:32,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:41:32,288 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:41:32,288 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-02-08 05:41:32,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-02-08 05:41:32,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:41:32,290 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:32,349 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-02-08 05:41:32,349 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:41:32,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:41:32 BasicIcfg [2025-02-08 05:41:32,357 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:41:32,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:41:32,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:41:32,358 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:41:32,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:27" (3/4) ... [2025-02-08 05:41:32,359 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:41:32,420 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-02-08 05:41:32,460 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:41:32,460 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:41:32,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:41:32,463 INFO L158 Benchmark]: Toolchain (without parser) took 5946.87ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 104.7MB in the beginning and 211.5MB in the end (delta: -106.8MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2025-02-08 05:41:32,463 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:32,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.24ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 84.8MB in the end (delta: 18.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:32,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.35ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:32,464 INFO L158 Benchmark]: Boogie Preprocessor took 22.34ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 81.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:32,465 INFO L158 Benchmark]: IcfgBuilder took 484.96ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 63.5MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:41:32,466 INFO L158 Benchmark]: TraceAbstraction took 4907.44ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 62.4MB in the beginning and 225.4MB in the end (delta: -162.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:32,466 INFO L158 Benchmark]: Witness Printer took 102.71ms. Allocated memory is still 302.0MB. Free memory was 225.4MB in the beginning and 211.5MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:32,467 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.24ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 84.8MB in the end (delta: 18.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.35ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.34ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 81.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 484.96ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 63.5MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4907.44ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 62.4MB in the beginning and 225.4MB in the end (delta: -162.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Witness Printer took 102.71ms. Allocated memory is still 302.0MB. Free memory was 225.4MB in the beginning and 211.5MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0] [L736] 0 pthread_t salethreads[15]; VAL [\old(argc)=61, \old(argv)={65:63}, argc=61, numOfTickets=0, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L738] 0 numOfTickets = 15 VAL [\old(argc)=61, \old(argv)={65:63}, argc=61, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=61, \old(argv)={65:63}, argc=61, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=61, \old(argv)={65:63}, argc=61, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=61, \old(argv)={65:63}, argc=61, i=0, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 15 VAL [numOfTickets=15, numberOfSeatsSold=0, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=61, \old(argv)={65:63}, argc=61, i=0, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=61, \old(argv)={65:63}, argc=61, i=0, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] 0 i++ VAL [\old(arg)={0:0}, \old(argc)=61, \old(argv)={65:63}, argc=61, i=1, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 15 VAL [\old(arg)={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=61, \old(argv)={65:63}, argc=61, i=1, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=61, \old(argv)={65:63}, argc=61, i=1, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (15 - (((15 / 10) == 0) ? 1 : (15 / 10)))) VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=1, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=1, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 111 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 9 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 129 locations, 19 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 37 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=421occurred in iteration=8, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:41:32,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)