./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/13_unverif.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/13_unverif.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 ea403ebfe777a86c8f08ec54b02dc30e546c8fae743fed5fb0e88129df40ac76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:04:51,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:04:51,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:04:51,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:04:51,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:04:51,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:04:51,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:04:51,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:04:51,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:04:51,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:04:51,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:04:51,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:04:51,896 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:04:51,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:04:51,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:04:51,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:04:51,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:04:51,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:04:51,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:04:51,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:04:51,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:04:51,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:04:51,897 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:04:51,897 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:04:51,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:04:51,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:04:51,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:04:51,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:04:51,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:04:51,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:04:51,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:04:51,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:51,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:04:51,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:04:51,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:04:51,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:51,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:04:51,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:04:51,899 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:04:51,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:04:51,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:04:51,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:04:51,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:04:51,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:04:51,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:04:51,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:04:51,901 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 -> ea403ebfe777a86c8f08ec54b02dc30e546c8fae743fed5fb0e88129df40ac76 [2025-01-09 21:04:52,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:04:52,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:04:52,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:04:52,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:04:52,210 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:04:52,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/13_unverif.i [2025-01-09 21:04:53,525 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a26409b2b/5a8f6bd9ba3b401cb809d60adee684ee/FLAGae5053bca [2025-01-09 21:04:53,921 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:04:53,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/13_unverif.i [2025-01-09 21:04:53,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a26409b2b/5a8f6bd9ba3b401cb809d60adee684ee/FLAGae5053bca [2025-01-09 21:04:53,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a26409b2b/5a8f6bd9ba3b401cb809d60adee684ee [2025-01-09 21:04:53,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:04:53,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:04:53,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:04:53,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:04:53,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:04:53,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:04:53" (1/1) ... [2025-01-09 21:04:53,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4b41c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:53, skipping insertion in model container [2025-01-09 21:04:53,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:04:53" (1/1) ... [2025-01-09 21:04:53,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:04:54,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:04:54,294 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:04:54,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:04:54,357 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:04:54,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54 WrapperNode [2025-01-09 21:04:54,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:04:54,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:04:54,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:04:54,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:04:54,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,388 INFO L138 Inliner]: procedures = 167, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 57 [2025-01-09 21:04:54,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:04:54,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:04:54,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:04:54,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:04:54,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:04:54,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:04:54,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:04:54,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:04:54,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:54,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:54,437 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-01-09 21:04:54,439 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-01-09 21:04:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:04:54,461 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:04:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:04:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:04:54,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:04:54,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:04:54,464 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:04:54,578 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:04:54,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:04:54,687 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:04:54,687 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:04:54,741 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:04:54,741 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:04:54,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:54 BoogieIcfgContainer [2025-01-09 21:04:54,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:04:54,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:04:54,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:04:54,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:04:54,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:04:53" (1/3) ... [2025-01-09 21:04:54,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9cef1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:04:54, skipping insertion in model container [2025-01-09 21:04:54,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (2/3) ... [2025-01-09 21:04:54,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9cef1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:04:54, skipping insertion in model container [2025-01-09 21:04:54,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:54" (3/3) ... [2025-01-09 21:04:54,751 INFO L128 eAbstractionObserver]: Analyzing ICFG 13_unverif.i [2025-01-09 21:04:54,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:04:54,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13_unverif.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 7 error locations. [2025-01-09 21:04:54,767 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:04:54,827 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:54,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 114 flow [2025-01-09 21:04:54,904 INFO L124 PetriNetUnfolderBase]: 3/62 cut-off events. [2025-01-09 21:04:54,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:54,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 62 events. 3/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2025-01-09 21:04:54,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 114 flow [2025-01-09 21:04:54,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 114 flow [2025-01-09 21:04:54,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:54,935 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;@443b94b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:54,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-09 21:04:54,946 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:54,947 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:04:54,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:54,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:54,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:54,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:04:54,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:54,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1057637568, now seen corresponding path program 1 times [2025-01-09 21:04:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645240907] [2025-01-09 21:04:54,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 21:04:55,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 21:04:55,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:55,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:55,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645240907] [2025-01-09 21:04:55,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645240907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:55,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:55,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:04:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238808632] [2025-01-09 21:04:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:55,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:04:55,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:55,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:04:55,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:04:55,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 55 [2025-01-09 21:04:55,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 114 flow. Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 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-01-09 21:04:55,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:55,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 55 [2025-01-09 21:04:55,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:55,208 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-01-09 21:04:55,208 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:04:55,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 47 events. 1/47 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 5/46 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2025-01-09 21:04:55,209 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 2 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2025-01-09 21:04:55,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 96 flow [2025-01-09 21:04:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:04:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:04:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2025-01-09 21:04:55,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-01-09 21:04:55,224 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 114 flow. Second operand 2 states and 100 transitions. [2025-01-09 21:04:55,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 96 flow [2025-01-09 21:04:55,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 96 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:55,232 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 92 flow [2025-01-09 21:04:55,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-01-09 21:04:55,239 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -8 predicate places. [2025-01-09 21:04:55,240 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 92 flow [2025-01-09 21:04:55,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 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-01-09 21:04:55,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:55,241 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] [2025-01-09 21:04:55,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:04:55,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:04:55,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1517554948, now seen corresponding path program 1 times [2025-01-09 21:04:55,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011730438] [2025-01-09 21:04:55,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:04:55,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:04:55,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:55,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:55,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011730438] [2025-01-09 21:04:55,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011730438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:55,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:55,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:55,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445568878] [2025-01-09 21:04:55,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:55,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:55,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:55,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:55,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:55,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 55 [2025-01-09 21:04:55,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-01-09 21:04:55,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:55,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 55 [2025-01-09 21:04:55,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:55,392 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-01-09 21:04:55,392 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:04:55,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 46 events. 1/46 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 52. Up to 3 conditions per place. [2025-01-09 21:04:55,393 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 3 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2025-01-09 21:04:55,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 98 flow [2025-01-09 21:04:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2025-01-09 21:04:55,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8121212121212121 [2025-01-09 21:04:55,396 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 92 flow. Second operand 3 states and 134 transitions. [2025-01-09 21:04:55,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 98 flow [2025-01-09 21:04:55,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 98 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:55,400 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 92 flow [2025-01-09 21:04:55,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-01-09 21:04:55,401 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2025-01-09 21:04:55,401 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 92 flow [2025-01-09 21:04:55,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-01-09 21:04:55,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:55,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:55,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:04:55,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:04:55,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash -934930635, now seen corresponding path program 1 times [2025-01-09 21:04:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424422497] [2025-01-09 21:04:55,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:55,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:04:55,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:04:55,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:55,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:55,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:04:55,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:04:55,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:55,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:55,468 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:55,469 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-01-09 21:04:55,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-01-09 21:04:55,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-01-09 21:04:55,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-01-09 21:04:55,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-01-09 21:04:55,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-01-09 21:04:55,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-01-09 21:04:55,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-01-09 21:04:55,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-01-09 21:04:55,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-01-09 21:04:55,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-01-09 21:04:55,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-01-09 21:04:55,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-01-09 21:04:55,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-01-09 21:04:55,474 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-01-09 21:04:55,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:04:55,474 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 21:04:55,477 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:55,477 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:04:55,532 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:55,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 89 transitions, 188 flow [2025-01-09 21:04:55,568 INFO L124 PetriNetUnfolderBase]: 6/105 cut-off events. [2025-01-09 21:04:55,568 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:04:55,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 105 events. 6/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 225 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 75. Up to 3 conditions per place. [2025-01-09 21:04:55,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 89 transitions, 188 flow [2025-01-09 21:04:55,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 89 transitions, 188 flow [2025-01-09 21:04:55,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:55,579 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;@443b94b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:55,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-09 21:04:55,584 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:55,584 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:04:55,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:55,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:55,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:55,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:55,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1162575776, now seen corresponding path program 1 times [2025-01-09 21:04:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154924252] [2025-01-09 21:04:55,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:55,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 21:04:55,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 21:04:55,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:55,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154924252] [2025-01-09 21:04:55,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154924252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:55,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:55,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:04:55,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153918806] [2025-01-09 21:04:55,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:55,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:04:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:55,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:04:55,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:04:55,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89 [2025-01-09 21:04:55,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 188 flow. Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 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-01-09 21:04:55,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:55,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89 [2025-01-09 21:04:55,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:55,680 INFO L124 PetriNetUnfolderBase]: 6/129 cut-off events. [2025-01-09 21:04:55,681 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:04:55,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 129 events. 6/129 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 388 event pairs, 2 based on Foata normal form. 15/119 useless extension candidates. Maximal degree in co-relation 86. Up to 9 conditions per place. [2025-01-09 21:04:55,684 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 4 selfloop transitions, 0 changer transitions 0/71 dead transitions. [2025-01-09 21:04:55,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 160 flow [2025-01-09 21:04:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:04:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:04:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 159 transitions. [2025-01-09 21:04:55,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8932584269662921 [2025-01-09 21:04:55,687 INFO L175 Difference]: Start difference. First operand has 88 places, 89 transitions, 188 flow. Second operand 2 states and 159 transitions. [2025-01-09 21:04:55,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 160 flow [2025-01-09 21:04:55,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 71 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:55,690 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 152 flow [2025-01-09 21:04:55,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=152, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-01-09 21:04:55,690 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -13 predicate places. [2025-01-09 21:04:55,690 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 152 flow [2025-01-09 21:04:55,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 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-01-09 21:04:55,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:55,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:55,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:04:55,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,692 INFO L85 PathProgramCache]: Analyzing trace with hash 543836324, now seen corresponding path program 1 times [2025-01-09 21:04:55,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021520113] [2025-01-09 21:04:55,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:04:55,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:04:55,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:55,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021520113] [2025-01-09 21:04:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021520113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:55,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:55,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:55,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978448825] [2025-01-09 21:04:55,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:55,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:55,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:55,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:55,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:55,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2025-01-09 21:04:55,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-01-09 21:04:55,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:55,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2025-01-09 21:04:55,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:55,815 INFO L124 PetriNetUnfolderBase]: 23/253 cut-off events. [2025-01-09 21:04:55,816 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:04:55,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 253 events. 23/253 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1232 event pairs, 4 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 311. Up to 30 conditions per place. [2025-01-09 21:04:55,820 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 11 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2025-01-09 21:04:55,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 78 transitions, 205 flow [2025-01-09 21:04:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2025-01-09 21:04:55,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8127340823970037 [2025-01-09 21:04:55,823 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 152 flow. Second operand 3 states and 217 transitions. [2025-01-09 21:04:55,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 78 transitions, 205 flow [2025-01-09 21:04:55,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 78 transitions, 205 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:55,826 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 204 flow [2025-01-09 21:04:55,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2025-01-09 21:04:55,827 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -9 predicate places. [2025-01-09 21:04:55,828 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 204 flow [2025-01-09 21:04:55,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-01-09 21:04:55,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:55,828 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] [2025-01-09 21:04:55,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:04:55,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:55,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash 811620494, now seen corresponding path program 1 times [2025-01-09 21:04:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557259145] [2025-01-09 21:04:55,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:04:55,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:04:55,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:55,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:55,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557259145] [2025-01-09 21:04:55,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557259145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:55,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:55,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:55,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56535941] [2025-01-09 21:04:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:55,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:55,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:55,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:55,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:55,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 89 [2025-01-09 21:04:55,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-01-09 21:04:55,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:55,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 89 [2025-01-09 21:04:55,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:56,043 INFO L124 PetriNetUnfolderBase]: 89/492 cut-off events. [2025-01-09 21:04:56,044 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-01-09 21:04:56,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 492 events. 89/492 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2781 event pairs, 18 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 792. Up to 150 conditions per place. [2025-01-09 21:04:56,049 INFO L140 encePairwiseOnDemand]: 75/89 looper letters, 23 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2025-01-09 21:04:56,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 90 transitions, 309 flow [2025-01-09 21:04:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-01-09 21:04:56,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7827715355805244 [2025-01-09 21:04:56,054 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 204 flow. Second operand 3 states and 209 transitions. [2025-01-09 21:04:56,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 90 transitions, 309 flow [2025-01-09 21:04:56,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:04:56,059 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 280 flow [2025-01-09 21:04:56,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2025-01-09 21:04:56,061 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -7 predicate places. [2025-01-09 21:04:56,061 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 280 flow [2025-01-09 21:04:56,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-01-09 21:04:56,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,062 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:56,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:04:56,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:04:56,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1073506521, now seen corresponding path program 1 times [2025-01-09 21:04:56,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160477971] [2025-01-09 21:04:56,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 21:04:56,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 21:04:56,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:56,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:56,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 21:04:56,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 21:04:56,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:56,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:56,097 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:56,097 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-01-09 21:04:56,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-01-09 21:04:56,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-01-09 21:04:56,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-01-09 21:04:56,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-01-09 21:04:56,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-01-09 21:04:56,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-01-09 21:04:56,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-01-09 21:04:56,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-01-09 21:04:56,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-01-09 21:04:56,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-01-09 21:04:56,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-01-09 21:04:56,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-01-09 21:04:56,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-01-09 21:04:56,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-01-09 21:04:56,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-01-09 21:04:56,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-01-09 21:04:56,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-01-09 21:04:56,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-01-09 21:04:56,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-01-09 21:04:56,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-01-09 21:04:56,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-01-09 21:04:56,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:04:56,100 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:04:56,101 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:04:56,101 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:04:56,141 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:56,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 123 transitions, 264 flow [2025-01-09 21:04:56,196 INFO L124 PetriNetUnfolderBase]: 9/148 cut-off events. [2025-01-09 21:04:56,196 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:04:56,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 9/148 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 409 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2025-01-09 21:04:56,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 123 transitions, 264 flow [2025-01-09 21:04:56,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 123 transitions, 264 flow [2025-01-09 21:04:56,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:56,202 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;@443b94b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:56,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-09 21:04:56,205 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:56,205 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:04:56,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:56,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:56,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:04:56,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash 707701311, now seen corresponding path program 1 times [2025-01-09 21:04:56,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734519094] [2025-01-09 21:04:56,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 21:04:56,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 21:04:56,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:56,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:56,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734519094] [2025-01-09 21:04:56,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734519094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:56,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:56,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:04:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487144507] [2025-01-09 21:04:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:56,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:04:56,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:56,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:04:56,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:04:56,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 123 [2025-01-09 21:04:56,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 123 transitions, 264 flow. Second operand has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 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-01-09 21:04:56,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:56,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 123 [2025-01-09 21:04:56,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:56,280 INFO L124 PetriNetUnfolderBase]: 21/313 cut-off events. [2025-01-09 21:04:56,280 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:04:56,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 313 events. 21/313 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1643 event pairs, 10 based on Foata normal form. 37/281 useless extension candidates. Maximal degree in co-relation 196. Up to 25 conditions per place. [2025-01-09 21:04:56,283 INFO L140 encePairwiseOnDemand]: 107/123 looper letters, 6 selfloop transitions, 0 changer transitions 0/98 dead transitions. [2025-01-09 21:04:56,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 226 flow [2025-01-09 21:04:56,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:04:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:04:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 218 transitions. [2025-01-09 21:04:56,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8861788617886179 [2025-01-09 21:04:56,284 INFO L175 Difference]: Start difference. First operand has 121 places, 123 transitions, 264 flow. Second operand 2 states and 218 transitions. [2025-01-09 21:04:56,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 226 flow [2025-01-09 21:04:56,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 98 transitions, 224 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:56,290 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 212 flow [2025-01-09 21:04:56,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=212, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2025-01-09 21:04:56,291 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -18 predicate places. [2025-01-09 21:04:56,291 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 212 flow [2025-01-09 21:04:56,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 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-01-09 21:04:56,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,291 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] [2025-01-09 21:04:56,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:04:56,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:04:56,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1496143587, now seen corresponding path program 1 times [2025-01-09 21:04:56,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712847104] [2025-01-09 21:04:56,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:04:56,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:04:56,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:56,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:56,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712847104] [2025-01-09 21:04:56,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712847104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:56,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:56,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:56,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44945883] [2025-01-09 21:04:56,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:56,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:56,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:56,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:56,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:56,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 123 [2025-01-09 21:04:56,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-01-09 21:04:56,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:56,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 123 [2025-01-09 21:04:56,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:56,571 INFO L124 PetriNetUnfolderBase]: 271/1711 cut-off events. [2025-01-09 21:04:56,572 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-09 21:04:56,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2209 conditions, 1711 events. 271/1711 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 15983 event pairs, 67 based on Foata normal form. 0/1367 useless extension candidates. Maximal degree in co-relation 2203. Up to 271 conditions per place. [2025-01-09 21:04:56,588 INFO L140 encePairwiseOnDemand]: 111/123 looper letters, 17 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2025-01-09 21:04:56,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 109 transitions, 296 flow [2025-01-09 21:04:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-01-09 21:04:56,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8021680216802168 [2025-01-09 21:04:56,590 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 212 flow. Second operand 3 states and 296 transitions. [2025-01-09 21:04:56,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 109 transitions, 296 flow [2025-01-09 21:04:56,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 109 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:04:56,594 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 290 flow [2025-01-09 21:04:56,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2025-01-09 21:04:56,595 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -14 predicate places. [2025-01-09 21:04:56,595 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 290 flow [2025-01-09 21:04:56,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-01-09 21:04:56,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,596 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] [2025-01-09 21:04:56,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:04:56,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:04:56,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1556542710, now seen corresponding path program 1 times [2025-01-09 21:04:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263183702] [2025-01-09 21:04:56,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:04:56,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:04:56,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:56,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:56,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263183702] [2025-01-09 21:04:56,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263183702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:56,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:56,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:56,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573839071] [2025-01-09 21:04:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:56,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:56,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:56,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:56,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:56,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 123 [2025-01-09 21:04:56,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:56,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:56,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 123 [2025-01-09 21:04:56,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:57,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][101], [38#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 60#L699-1true, 120#true, Black: 126#true, 124#true, 85#L709-3true, 122#true, 128#(= |#race~r~0| 0), 6#L701-2true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:57,484 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2025-01-09 21:04:57,485 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-01-09 21:04:57,485 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-01-09 21:04:57,485 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-01-09 21:04:57,586 INFO L124 PetriNetUnfolderBase]: 2449/7994 cut-off events. [2025-01-09 21:04:57,587 INFO L125 PetriNetUnfolderBase]: For 1543/1543 co-relation queries the response was YES. [2025-01-09 21:04:57,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13833 conditions, 7994 events. 2449/7994 cut-off events. For 1543/1543 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 84106 event pairs, 629 based on Foata normal form. 0/6838 useless extension candidates. Maximal degree in co-relation 13825. Up to 3187 conditions per place. [2025-01-09 21:04:57,669 INFO L140 encePairwiseOnDemand]: 102/123 looper letters, 38 selfloop transitions, 15 changer transitions 0/130 dead transitions. [2025-01-09 21:04:57,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 130 transitions, 470 flow [2025-01-09 21:04:57,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-01-09 21:04:57,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7696476964769647 [2025-01-09 21:04:57,671 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 290 flow. Second operand 3 states and 284 transitions. [2025-01-09 21:04:57,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 130 transitions, 470 flow [2025-01-09 21:04:57,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 130 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:04:57,680 INFO L231 Difference]: Finished difference. Result has 109 places, 122 transitions, 404 flow [2025-01-09 21:04:57,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=109, PETRI_TRANSITIONS=122} [2025-01-09 21:04:57,682 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -12 predicate places. [2025-01-09 21:04:57,683 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 122 transitions, 404 flow [2025-01-09 21:04:57,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:04:57,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:57,683 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] [2025-01-09 21:04:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:04:57,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:04:57,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash -81598899, now seen corresponding path program 1 times [2025-01-09 21:04:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309965405] [2025-01-09 21:04:57,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:57,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:57,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 21:04:57,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 21:04:57,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:04:57,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:57,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309965405] [2025-01-09 21:04:57,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309965405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:57,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:57,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:57,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340609248] [2025-01-09 21:04:57,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:57,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:57,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:57,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:57,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:57,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 123 [2025-01-09 21:04:57,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 122 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-01-09 21:04:57,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:57,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 123 [2025-01-09 21:04:57,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:58,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][113], [136#true, 120#true, 60#L699-1true, Black: 126#true, 124#true, 85#L709-3true, Black: 131#true, 122#true, 133#(= |#race~s~0| 0), 91#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 118#true, 68#L699-5true]) [2025-01-09 21:04:58,455 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2025-01-09 21:04:58,455 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-01-09 21:04:58,455 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-01-09 21:04:58,455 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-01-09 21:04:58,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][137], [120#true, 60#L699-1true, 136#true, Black: 126#true, 124#true, 85#L709-3true, Black: 131#true, 122#true, 73#L700true, 6#L701-2true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,458 INFO L294 olderBase$Statistics]: this new event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,458 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,458 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,458 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][113], [60#L699-1true, 120#true, 136#true, Black: 126#true, 124#true, Black: 131#true, 85#L709-3true, 73#L700true, 122#true, 133#(= |#race~s~0| 0), 91#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 118#true]) [2025-01-09 21:04:58,485 INFO L294 olderBase$Statistics]: this new event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,485 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-01-09 21:04:58,485 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-01-09 21:04:58,485 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-01-09 21:04:58,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][136], [120#true, 136#true, 17#L699-1true, Black: 126#true, 124#true, 85#L709-3true, Black: 131#true, 73#L700true, 122#true, 70#L699-2true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,565 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2025-01-09 21:04:58,565 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-01-09 21:04:58,565 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2025-01-09 21:04:58,565 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-01-09 21:04:58,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][137], [136#true, 120#true, 60#L699-1true, Black: 126#true, 124#true, Black: 131#true, 85#L709-3true, 122#true, 73#L700true, 133#(= |#race~s~0| 0), 56#L699-2true, 118#true]) [2025-01-09 21:04:58,567 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2025-01-09 21:04:58,567 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-01-09 21:04:58,567 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2025-01-09 21:04:58,567 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2025-01-09 21:04:58,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][97], [60#L699-1true, 136#true, 120#true, 111#L701-1true, Black: 126#true, 124#true, 44#L699-2true, Black: 131#true, 85#L709-3true, 122#true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,637 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2025-01-09 21:04:58,637 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-01-09 21:04:58,637 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-01-09 21:04:58,638 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-01-09 21:04:58,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][97], [120#true, 60#L699-1true, 136#true, Black: 126#true, 124#true, 85#L709-3true, Black: 131#true, 122#true, 6#L701-2true, 133#(= |#race~s~0| 0), 118#true, 23#L699-1true]) [2025-01-09 21:04:58,639 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2025-01-09 21:04:58,639 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-01-09 21:04:58,639 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-01-09 21:04:58,639 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2025-01-09 21:04:58,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][97], [120#true, 60#L699-1true, 136#true, 111#L701-1true, Black: 126#true, 124#true, 85#L709-3true, Black: 131#true, 122#true, 133#(= |#race~s~0| 0), 13#L699-4true, 118#true]) [2025-01-09 21:04:58,651 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2025-01-09 21:04:58,651 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-01-09 21:04:58,651 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2025-01-09 21:04:58,651 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:04:58,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][97], [120#true, 60#L699-1true, 136#true, Black: 126#true, 124#true, 44#L699-2true, 85#L709-3true, Black: 131#true, 122#true, 6#L701-2true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,652 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2025-01-09 21:04:58,653 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-01-09 21:04:58,653 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-01-09 21:04:58,653 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2025-01-09 21:04:58,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][97], [120#true, 60#L699-1true, 136#true, Black: 126#true, 124#true, 85#L709-3true, Black: 131#true, 122#true, 6#L701-2true, 133#(= |#race~s~0| 0), 13#L699-4true, 118#true]) [2025-01-09 21:04:58,665 INFO L294 olderBase$Statistics]: this new event has 69 ancestors and is cut-off event [2025-01-09 21:04:58,665 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-01-09 21:04:58,665 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2025-01-09 21:04:58,665 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-01-09 21:04:58,677 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][137], [60#L699-1true, 136#true, 120#true, Black: 126#true, 124#true, Black: 131#true, 85#L709-3true, 73#L700true, 122#true, 6#L701-2true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,678 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2025-01-09 21:04:58,678 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,678 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,678 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,678 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][136], [136#true, 120#true, 17#L699-1true, Black: 126#true, 106#L701-2true, 124#true, Black: 131#true, 85#L709-3true, 73#L700true, 122#true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,687 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2025-01-09 21:04:58,687 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-01-09 21:04:58,687 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,687 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][97], [60#L699-1true, 136#true, 120#true, Black: 126#true, 124#true, 33#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, Black: 131#true, 85#L709-3true, 122#true, 6#L701-2true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,688 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2025-01-09 21:04:58,688 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-01-09 21:04:58,688 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,688 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,688 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][137], [60#L699-1true, 136#true, 120#true, Black: 126#true, 124#true, Black: 131#true, 85#L709-3true, 122#true, 73#L700true, 6#L701-2true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,689 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2025-01-09 21:04:58,689 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,689 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,689 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-01-09 21:04:58,689 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,689 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2025-01-09 21:04:58,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][97], [120#true, 60#L699-1true, 136#true, 111#L701-1true, Black: 126#true, 124#true, 114#L701-2true, 85#L709-3true, Black: 131#true, 122#true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,754 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-01-09 21:04:58,755 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2025-01-09 21:04:58,755 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2025-01-09 21:04:58,755 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2025-01-09 21:04:58,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][97], [60#L699-1true, 136#true, 120#true, Black: 126#true, 124#true, Black: 131#true, 85#L709-3true, 122#true, 14#L701-1true, 6#L701-2true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,756 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-01-09 21:04:58,756 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2025-01-09 21:04:58,756 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2025-01-09 21:04:58,756 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2025-01-09 21:04:58,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][97], [120#true, 60#L699-1true, 136#true, Black: 126#true, 124#true, 114#L701-2true, 85#L709-3true, Black: 131#true, 122#true, 6#L701-2true, 133#(= |#race~s~0| 0), 118#true]) [2025-01-09 21:04:58,759 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-01-09 21:04:58,759 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2025-01-09 21:04:58,759 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2025-01-09 21:04:58,759 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2025-01-09 21:04:58,762 INFO L124 PetriNetUnfolderBase]: 3190/9540 cut-off events. [2025-01-09 21:04:58,764 INFO L125 PetriNetUnfolderBase]: For 5685/5975 co-relation queries the response was YES. [2025-01-09 21:04:58,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20813 conditions, 9540 events. 3190/9540 cut-off events. For 5685/5975 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 99274 event pairs, 896 based on Foata normal form. 51/8091 useless extension candidates. Maximal degree in co-relation 20804. Up to 3526 conditions per place. [2025-01-09 21:04:58,842 INFO L140 encePairwiseOnDemand]: 113/123 looper letters, 34 selfloop transitions, 17 changer transitions 0/143 dead transitions. [2025-01-09 21:04:58,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 143 transitions, 608 flow [2025-01-09 21:04:58,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2025-01-09 21:04:58,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7831978319783198 [2025-01-09 21:04:58,845 INFO L175 Difference]: Start difference. First operand has 109 places, 122 transitions, 404 flow. Second operand 3 states and 289 transitions. [2025-01-09 21:04:58,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 143 transitions, 608 flow [2025-01-09 21:04:58,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 143 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:04:58,862 INFO L231 Difference]: Finished difference. Result has 111 places, 137 transitions, 532 flow [2025-01-09 21:04:58,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=111, PETRI_TRANSITIONS=137} [2025-01-09 21:04:58,863 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -10 predicate places. [2025-01-09 21:04:58,863 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 137 transitions, 532 flow [2025-01-09 21:04:58,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-01-09 21:04:58,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:58,864 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:58,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:04:58,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:04:58,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1785208717, now seen corresponding path program 1 times [2025-01-09 21:04:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246511382] [2025-01-09 21:04:58,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:58,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:04:58,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:04:58,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:58,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:58,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:58,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:04:58,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:04:58,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:58,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:58,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:58,890 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:58,890 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2025-01-09 21:04:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-01-09 21:04:58,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-01-09 21:04:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-01-09 21:04:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-01-09 21:04:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-01-09 21:04:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-01-09 21:04:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-01-09 21:04:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 29 remaining) [2025-01-09 21:04:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-01-09 21:04:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-01-09 21:04:58,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-01-09 21:04:58,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-01-09 21:04:58,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-01-09 21:04:58,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-01-09 21:04:58,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-01-09 21:04:58,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-01-09 21:04:58,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:04:58,893 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:04:58,921 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2025-01-09 21:04:58,921 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:04:58,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:04:58 BasicIcfg [2025-01-09 21:04:58,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:04:58,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:04:58,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:04:58,931 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:04:58,932 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:54" (3/4) ... [2025-01-09 21:04:58,933 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:04:58,986 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-01-09 21:04:59,035 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:04:59,035 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:04:59,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:04:59,036 INFO L158 Benchmark]: Toolchain (without parser) took 5077.54ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 112.1MB in the beginning and 125.9MB in the end (delta: -13.8MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. [2025-01-09 21:04:59,036 INFO L158 Benchmark]: CDTParser took 1.30ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:04:59,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.56ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 92.5MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:04:59,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.94ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:04:59,037 INFO L158 Benchmark]: Boogie Preprocessor took 18.50ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 90.5MB in the end (delta: 413.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:04:59,037 INFO L158 Benchmark]: RCFGBuilder took 333.10ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 75.1MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:04:59,037 INFO L158 Benchmark]: TraceAbstraction took 4186.84ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 74.6MB in the beginning and 134.2MB in the end (delta: -59.6MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. [2025-01-09 21:04:59,037 INFO L158 Benchmark]: Witness Printer took 104.43ms. Allocated memory is still 302.0MB. Free memory was 134.2MB in the beginning and 125.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:04:59,039 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.56ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 92.5MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.94ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.50ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 90.5MB in the end (delta: 413.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 333.10ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 75.1MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4186.84ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 74.6MB in the beginning and 134.2MB in the end (delta: -59.6MB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. * Witness Printer took 104.43ms. Allocated memory is still 302.0MB. Free memory was 134.2MB in the beginning and 125.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 698]: Data race detected Data race detected The following path leads to a data race: [L688] 0 unsigned int r = 0; VAL [r=0] [L689] 0 unsigned int s = 0; VAL [r=0, s=0] [L707] 0 pthread_t t; VAL [r=0, s=0] [L709] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [r=0, s=0, t=-1] [L709] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [r=0, s=0, t=0] [L696] 1 unsigned int l = 0; VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=0, s=0] [L697] CALL 1 __VERIFIER_atomic_inc_r() [L692] EXPR 1 r!=-1 [L692] CALL 1 assume_abort_if_not(r!=-1) [L3] COND FALSE 1 !(!cond) [L692] RET 1 assume_abort_if_not(r!=-1) [L693] EXPR 1 r + 1 [L693] 1 r = r + 1 [L697] RET 1 __VERIFIER_atomic_inc_r() [L698] 1 r == 1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, s=0] [L696] 2 unsigned int l = 0; VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, s=0] [L697] CALL 2 __VERIFIER_atomic_inc_r() [L692] EXPR 2 r!=-1 [L692] CALL 2 assume_abort_if_not(r!=-1) [L3] COND FALSE 2 !(!cond) [L692] RET 2 assume_abort_if_not(r!=-1) [L693] EXPR 2 r + 1 [L693] 2 r = r + 1 [L697] RET 2 __VERIFIER_atomic_inc_r() [L698] 1 r == 1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=2, s=0] Now there is a data race on ~r~0 between C: r = r + 1 [693] and C: r == 1 [698] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: 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, 84 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 3 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=0, InterpolantAutomatonStates: 5, 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.1s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 38 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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, 115 locations, 22 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.6s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 26 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=3, InterpolantAutomatonStates: 8, 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.1s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 62 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 3 thread instances CFG has 5 procedures, 146 locations, 29 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 40 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=4, InterpolantAutomatonStates: 11, 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.1s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:04:59,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)