./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.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 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:23:47,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:23:47,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:23:47,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:23:48,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:23:48,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:23:48,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:23:48,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:23:48,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:23:48,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:23:48,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:23:48,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:23:48,014 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:23:48,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:23:48,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:23:48,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:23:48,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:23:48,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:23:48,016 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:23:48,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:23:48,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:23:48,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:23:48,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:23:48,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:23:48,016 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:23:48,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:23:48,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:23:48,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:23:48,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:23:48,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:23:48,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:23:48,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:23:48,017 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 -> 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba [2025-02-06 09:23:48,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:23:48,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:23:48,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:23:48,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:23:48,259 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:23:48,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i [2025-02-06 09:23:49,403 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa1c76bd2/180743b74bc54cdf87a0174e0a5bca3c/FLAG8903d3e3a [2025-02-06 09:23:49,673 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:23:49,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i [2025-02-06 09:23:49,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa1c76bd2/180743b74bc54cdf87a0174e0a5bca3c/FLAG8903d3e3a [2025-02-06 09:23:49,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa1c76bd2/180743b74bc54cdf87a0174e0a5bca3c [2025-02-06 09:23:49,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:23:49,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:23:49,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:23:49,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:23:49,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:23:49,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:23:49" (1/1) ... [2025-02-06 09:23:49,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263c013a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:49, skipping insertion in model container [2025-02-06 09:23:49,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:23:49" (1/1) ... [2025-02-06 09:23:50,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:23:50,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:23:50,291 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:23:50,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:23:50,359 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:23:50,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50 WrapperNode [2025-02-06 09:23:50,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:23:50,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:23:50,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:23:50,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:23:50,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,393 INFO L138 Inliner]: procedures = 259, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2025-02-06 09:23:50,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:23:50,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:23:50,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:23:50,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:23:50,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:23:50,410 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:23:50,410 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:23:50,410 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:23:50,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (1/1) ... [2025-02-06 09:23:50,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:23:50,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:50,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:23:50,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:23:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:23:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:23:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:23:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:23:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:23:50,462 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:23:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:23:50,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:23:50,463 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:23:50,549 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:23:50,551 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:23:50,658 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc main_~#id~0#1.base, main_~#id~0#1.offset; [2025-02-06 09:23:50,658 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L923-1: SUMMARY for call ULTIMATE.dealloc(main_~#id~0#1.base, main_~#id~0#1.offset); srcloc: null [2025-02-06 09:23:50,666 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:23:50,666 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:23:50,673 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:23:50,673 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:23:50,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:23:50 BoogieIcfgContainer [2025-02-06 09:23:50,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:23:50,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:23:50,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:23:50,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:23:50,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:23:49" (1/3) ... [2025-02-06 09:23:50,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfa92d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:23:50, skipping insertion in model container [2025-02-06 09:23:50,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:23:50" (2/3) ... [2025-02-06 09:23:50,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dfa92d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:23:50, skipping insertion in model container [2025-02-06 09:23:50,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:23:50" (3/3) ... [2025-02-06 09:23:50,681 INFO L128 eAbstractionObserver]: Analyzing ICFG 10-synch_02-thread_nonunique.i [2025-02-06 09:23:50,691 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:23:50,696 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 10-synch_02-thread_nonunique.i that has 2 procedures, 53 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-02-06 09:23:50,697 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:23:50,734 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:23:50,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 115 flow [2025-02-06 09:23:50,798 INFO L124 PetriNetUnfolderBase]: 1/82 cut-off events. [2025-02-06 09:23:50,804 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:23:50,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 82 events. 1/82 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 152 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 3. Up to 3 conditions per place. [2025-02-06 09:23:50,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 54 transitions, 115 flow [2025-02-06 09:23:50,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 54 transitions, 115 flow [2025-02-06 09:23:50,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:23:50,825 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;@260a8af2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:23:50,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 09:23:50,833 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:23:50,834 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-02-06 09:23:50,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:50,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:50,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:50,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:23:50,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1738162474, now seen corresponding path program 1 times [2025-02-06 09:23:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704630317] [2025-02-06 09:23:50,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:50,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:23:50,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:23:50,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:50,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:51,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704630317] [2025-02-06 09:23:51,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704630317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:51,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:51,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:23:51,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764826370] [2025-02-06 09:23:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:51,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:23:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:51,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:23:51,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:23:51,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 54 [2025-02-06 09:23:51,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:51,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:51,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 54 [2025-02-06 09:23:51,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:51,135 INFO L124 PetriNetUnfolderBase]: 0/73 cut-off events. [2025-02-06 09:23:51,135 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:23:51,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 73 events. 0/73 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 2/70 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-02-06 09:23:51,137 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 5 selfloop transitions, 4 changer transitions 7/54 dead transitions. [2025-02-06 09:23:51,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 137 flow [2025-02-06 09:23:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:23:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:23:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2025-02-06 09:23:51,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8765432098765432 [2025-02-06 09:23:51,147 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 115 flow. Second operand 3 states and 142 transitions. [2025-02-06 09:23:51,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 137 flow [2025-02-06 09:23:51,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 137 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:51,154 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 115 flow [2025-02-06 09:23:51,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2025-02-06 09:23:51,159 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2025-02-06 09:23:51,159 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 115 flow [2025-02-06 09:23:51,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:51,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:51,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:51,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:23:51,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:23:51,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:51,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1147031457, now seen corresponding path program 1 times [2025-02-06 09:23:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:51,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912312243] [2025-02-06 09:23:51,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:51,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 09:23:51,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 09:23:51,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:51,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:51,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:51,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912312243] [2025-02-06 09:23:51,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912312243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:51,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:51,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:51,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327234369] [2025-02-06 09:23:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:51,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:51,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:51,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:51,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:51,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 54 [2025-02-06 09:23:51,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:51,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:51,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 54 [2025-02-06 09:23:51,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:51,665 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2025-02-06 09:23:51,665 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:23:51,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 64 events. 0/64 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 0. Up to 21 conditions per place. [2025-02-06 09:23:51,665 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 15 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2025-02-06 09:23:51,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 153 flow [2025-02-06 09:23:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2025-02-06 09:23:51,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-02-06 09:23:51,668 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 115 flow. Second operand 6 states and 207 transitions. [2025-02-06 09:23:51,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 153 flow [2025-02-06 09:23:51,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:23:51,669 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 115 flow [2025-02-06 09:23:51,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2025-02-06 09:23:51,670 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-02-06 09:23:51,670 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 115 flow [2025-02-06 09:23:51,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:51,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:51,670 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] [2025-02-06 09:23:51,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:23:51,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:23:51,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash -212829447, now seen corresponding path program 1 times [2025-02-06 09:23:51,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:51,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146754818] [2025-02-06 09:23:51,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:51,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:51,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 09:23:51,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 09:23:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:51,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:51,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146754818] [2025-02-06 09:23:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146754818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:51,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:23:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487665691] [2025-02-06 09:23:51,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:51,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:23:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:51,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:23:51,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:23:51,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 54 [2025-02-06 09:23:51,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:51,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:51,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 54 [2025-02-06 09:23:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:51,732 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2025-02-06 09:23:51,732 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-02-06 09:23:51,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 63 events. 0/63 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-02-06 09:23:51,732 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 4 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-02-06 09:23:51,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 125 flow [2025-02-06 09:23:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:23:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:23:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-02-06 09:23:51,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2025-02-06 09:23:51,733 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 115 flow. Second operand 3 states and 148 transitions. [2025-02-06 09:23:51,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 125 flow [2025-02-06 09:23:51,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 115 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:51,734 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 107 flow [2025-02-06 09:23:51,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-02-06 09:23:51,735 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2025-02-06 09:23:51,735 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 107 flow [2025-02-06 09:23:51,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:51,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:51,735 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] [2025-02-06 09:23:51,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:23:51,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:23:51,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash -386457375, now seen corresponding path program 1 times [2025-02-06 09:23:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:51,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987202881] [2025-02-06 09:23:51,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:51,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:51,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:23:51,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:23:51,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:51,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987202881] [2025-02-06 09:23:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987202881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:51,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:51,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114877921] [2025-02-06 09:23:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:51,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:23:51,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:51,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:23:51,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:23:52,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 54 [2025-02-06 09:23:52,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:52,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 54 [2025-02-06 09:23:52,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:52,044 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-02-06 09:23:52,044 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:23:52,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 41 events. 0/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 16 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-02-06 09:23:52,044 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 3 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2025-02-06 09:23:52,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 86 flow [2025-02-06 09:23:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 254 transitions. [2025-02-06 09:23:52,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7839506172839507 [2025-02-06 09:23:52,045 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 107 flow. Second operand 6 states and 254 transitions. [2025-02-06 09:23:52,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 86 flow [2025-02-06 09:23:52,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 09:23:52,046 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 74 flow [2025-02-06 09:23:52,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2025-02-06 09:23:52,047 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -17 predicate places. [2025-02-06 09:23:52,047 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 74 flow [2025-02-06 09:23:52,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:52,047 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] [2025-02-06 09:23:52,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:23:52,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:23:52,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -451972403, now seen corresponding path program 1 times [2025-02-06 09:23:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936924489] [2025-02-06 09:23:52,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:52,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:23:52,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:23:52,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:52,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:23:52,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:23:52,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:23:52,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:23:52,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:52,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:23:52,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:23:52,078 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:23:52,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 09:23:52,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-02-06 09:23:52,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-02-06 09:23:52,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-02-06 09:23:52,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-02-06 09:23:52,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:23:52,083 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 09:23:52,084 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:23:52,084 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:23:52,094 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:23:52,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 65 transitions, 146 flow [2025-02-06 09:23:52,109 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2025-02-06 09:23:52,109 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:23:52,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 147 events. 3/147 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 304 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 84. Up to 6 conditions per place. [2025-02-06 09:23:52,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 65 transitions, 146 flow [2025-02-06 09:23:52,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 65 transitions, 146 flow [2025-02-06 09:23:52,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:23:52,111 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;@260a8af2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:23:52,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 09:23:52,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:23:52,114 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-02-06 09:23:52,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:52,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:52,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:52,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:23:52,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:52,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1853816725, now seen corresponding path program 1 times [2025-02-06 09:23:52,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:52,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183904866] [2025-02-06 09:23:52,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:52,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:52,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 09:23:52,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 09:23:52,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:52,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:52,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183904866] [2025-02-06 09:23:52,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183904866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:52,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:52,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:23:52,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006682921] [2025-02-06 09:23:52,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:52,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:23:52,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:52,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:23:52,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:23:52,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 65 [2025-02-06 09:23:52,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:52,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 65 [2025-02-06 09:23:52,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:52,194 INFO L124 PetriNetUnfolderBase]: 2/149 cut-off events. [2025-02-06 09:23:52,194 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 09:23:52,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 149 events. 2/149 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 339 event pairs, 0 based on Foata normal form. 3/142 useless extension candidates. Maximal degree in co-relation 36. Up to 20 conditions per place. [2025-02-06 09:23:52,195 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 13 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-02-06 09:23:52,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 194 flow [2025-02-06 09:23:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:23:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:23:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-02-06 09:23:52,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-02-06 09:23:52,195 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 146 flow. Second operand 3 states and 175 transitions. [2025-02-06 09:23:52,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 194 flow [2025-02-06 09:23:52,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:52,197 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 170 flow [2025-02-06 09:23:52,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-02-06 09:23:52,197 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-02-06 09:23:52,197 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 170 flow [2025-02-06 09:23:52,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:52,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:52,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:23:52,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:23:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1464826049, now seen corresponding path program 1 times [2025-02-06 09:23:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37792558] [2025-02-06 09:23:52,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:52,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 09:23:52,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 09:23:52,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:52,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:52,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37792558] [2025-02-06 09:23:52,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37792558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:52,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:52,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:52,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737626419] [2025-02-06 09:23:52,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:52,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:52,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:52,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:52,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:52,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 65 [2025-02-06 09:23:52,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:52,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 65 [2025-02-06 09:23:52,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:52,487 INFO L124 PetriNetUnfolderBase]: 2/146 cut-off events. [2025-02-06 09:23:52,487 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 09:23:52,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 146 events. 2/146 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 322 event pairs, 1 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 45. Up to 52 conditions per place. [2025-02-06 09:23:52,488 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 20 selfloop transitions, 6 changer transitions 0/66 dead transitions. [2025-02-06 09:23:52,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 220 flow [2025-02-06 09:23:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 265 transitions. [2025-02-06 09:23:52,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2025-02-06 09:23:52,489 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 170 flow. Second operand 6 states and 265 transitions. [2025-02-06 09:23:52,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 220 flow [2025-02-06 09:23:52,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:23:52,491 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 176 flow [2025-02-06 09:23:52,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2025-02-06 09:23:52,492 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2025-02-06 09:23:52,492 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 176 flow [2025-02-06 09:23:52,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:52,492 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] [2025-02-06 09:23:52,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:23:52,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:23:52,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:52,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1270835728, now seen corresponding path program 1 times [2025-02-06 09:23:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:52,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848155096] [2025-02-06 09:23:52,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:52,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 09:23:52,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 09:23:52,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:52,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:52,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:52,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848155096] [2025-02-06 09:23:52,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848155096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:52,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:52,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:23:52,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224300270] [2025-02-06 09:23:52,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:52,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:23:52,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:52,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:23:52,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:23:52,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 65 [2025-02-06 09:23:52,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:52,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 65 [2025-02-06 09:23:52,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:52,561 INFO L124 PetriNetUnfolderBase]: 18/301 cut-off events. [2025-02-06 09:23:52,562 INFO L125 PetriNetUnfolderBase]: For 69/98 co-relation queries the response was YES. [2025-02-06 09:23:52,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 301 events. 18/301 cut-off events. For 69/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1415 event pairs, 8 based on Foata normal form. 3/276 useless extension candidates. Maximal degree in co-relation 174. Up to 34 conditions per place. [2025-02-06 09:23:52,565 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 11 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2025-02-06 09:23:52,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 224 flow [2025-02-06 09:23:52,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:23:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:23:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-02-06 09:23:52,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9282051282051282 [2025-02-06 09:23:52,568 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 176 flow. Second operand 3 states and 181 transitions. [2025-02-06 09:23:52,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 224 flow [2025-02-06 09:23:52,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 212 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:52,570 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 194 flow [2025-02-06 09:23:52,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-02-06 09:23:52,571 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-02-06 09:23:52,571 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 194 flow [2025-02-06 09:23:52,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:52,571 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] [2025-02-06 09:23:52,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:23:52,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:23:52,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:52,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1207625163, now seen corresponding path program 1 times [2025-02-06 09:23:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537326313] [2025-02-06 09:23:52,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:52,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:52,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:23:52,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:23:52,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:52,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:52,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:52,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537326313] [2025-02-06 09:23:52,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537326313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:52,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:52,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:52,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056213043] [2025-02-06 09:23:52,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:52,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:23:52,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:52,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:23:52,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:23:52,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 65 [2025-02-06 09:23:52,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:52,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 65 [2025-02-06 09:23:52,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:52,764 INFO L124 PetriNetUnfolderBase]: 4/210 cut-off events. [2025-02-06 09:23:52,765 INFO L125 PetriNetUnfolderBase]: For 41/46 co-relation queries the response was YES. [2025-02-06 09:23:52,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 210 events. 4/210 cut-off events. For 41/46 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 730 event pairs, 1 based on Foata normal form. 3/199 useless extension candidates. Maximal degree in co-relation 167. Up to 26 conditions per place. [2025-02-06 09:23:52,766 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 14 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2025-02-06 09:23:52,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 250 flow [2025-02-06 09:23:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 322 transitions. [2025-02-06 09:23:52,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8256410256410256 [2025-02-06 09:23:52,768 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 194 flow. Second operand 6 states and 322 transitions. [2025-02-06 09:23:52,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 250 flow [2025-02-06 09:23:52,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:23:52,769 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 218 flow [2025-02-06 09:23:52,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2025-02-06 09:23:52,771 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2025-02-06 09:23:52,771 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 218 flow [2025-02-06 09:23:52,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:52,772 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] [2025-02-06 09:23:52,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:23:52,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:23:52,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1861394200, now seen corresponding path program 1 times [2025-02-06 09:23:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:52,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504583606] [2025-02-06 09:23:52,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:52,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 09:23:52,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 09:23:52,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:52,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:52,798 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-06 09:23:52,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:52,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504583606] [2025-02-06 09:23:52,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504583606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:52,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:52,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:23:52,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849156976] [2025-02-06 09:23:52,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:52,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:23:52,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:52,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:23:52,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:23:52,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 65 [2025-02-06 09:23:52,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:52,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 65 [2025-02-06 09:23:52,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:52,836 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2025-02-06 09:23:52,836 INFO L125 PetriNetUnfolderBase]: For 93/190 co-relation queries the response was YES. [2025-02-06 09:23:52,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 311 events. 18/311 cut-off events. For 93/190 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1468 event pairs, 9 based on Foata normal form. 2/291 useless extension candidates. Maximal degree in co-relation 397. Up to 37 conditions per place. [2025-02-06 09:23:52,838 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 10 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-02-06 09:23:52,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 261 flow [2025-02-06 09:23:52,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:23:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:23:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-02-06 09:23:52,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-02-06 09:23:52,838 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 218 flow. Second operand 3 states and 180 transitions. [2025-02-06 09:23:52,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 261 flow [2025-02-06 09:23:52,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 251 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:23:52,840 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 244 flow [2025-02-06 09:23:52,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2025-02-06 09:23:52,841 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2025-02-06 09:23:52,841 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 244 flow [2025-02-06 09:23:52,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:23:52,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:52,841 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] [2025-02-06 09:23:52,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:23:52,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:23:52,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1392421649, now seen corresponding path program 1 times [2025-02-06 09:23:52,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996776305] [2025-02-06 09:23:52,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:52,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:23:52,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:23:52,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:52,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:23:52,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:23:52,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:23:52,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:23:52,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:52,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:23:52,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:23:52,881 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:23:52,881 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2025-02-06 09:23:52,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-02-06 09:23:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-02-06 09:23:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 09:23:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-02-06 09:23:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-02-06 09:23:52,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:23:52,882 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:23:52,900 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-02-06 09:23:52,900 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:23:52,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:23:52 BasicIcfg [2025-02-06 09:23:52,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:23:52,904 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:23:52,904 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:23:52,904 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:23:52,905 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:23:50" (3/4) ... [2025-02-06 09:23:52,905 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 09:23:52,948 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 3. [2025-02-06 09:23:52,975 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:23:52,976 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:23:52,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:23:52,976 INFO L158 Benchmark]: Toolchain (without parser) took 2985.48ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 121.6MB in the end (delta: 8.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2025-02-06 09:23:52,976 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:23:52,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.10ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 103.9MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:23:52,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.27ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 101.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:23:52,977 INFO L158 Benchmark]: Boogie Preprocessor took 13.80ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 100.9MB in the end (delta: 983.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:23:52,977 INFO L158 Benchmark]: IcfgBuilder took 263.45ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 87.6MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:23:52,977 INFO L158 Benchmark]: TraceAbstraction took 2228.58ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 130.2MB in the end (delta: -43.1MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2025-02-06 09:23:52,982 INFO L158 Benchmark]: Witness Printer took 71.64ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 121.6MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:23:52,983 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.21ms. Allocated memory is still 226.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.10ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 103.9MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.27ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 101.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.80ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 100.9MB in the end (delta: 983.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 263.45ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 87.6MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2228.58ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 130.2MB in the end (delta: -43.1MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Witness Printer took 71.64ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 121.6MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 919]: Data race detected Data race detected The following path leads to a data race: [L917] 0 int myglobal; VAL [myglobal=0] [L923] 0 pthread_t id[10]; VAL [id={8:0}, myglobal=0] [L924] 0 int i; VAL [id={8:0}, myglobal=0] [L925] 0 i=0 VAL [i=0, id={8:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [myglobal=0] [L926] 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [i=0, id={8:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=0, id={8:0}, myglobal=0] [L925] 0 i++ VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [\old(arg)={0:0}, myglobal=0] [L926] 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L919] 2 myglobal=42 VAL [\old(arg)={0:0}, arg={0:0}, myglobal=42] [L919] 1 myglobal=42 VAL [\old(arg)={0:0}, arg={0:0}, myglobal=42] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] and C: myglobal=42 [919] - UnprovableResult [Line: 928]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: 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, 64 locations, 5 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: 1.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 36 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, InterpolantAutomatonStates: 18, 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.5s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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, 74 locations, 6 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: 0.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 22 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=5, InterpolantAutomatonStates: 21, 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.2s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 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-06 09:23:53,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)