./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp3x3.wvr.c -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 21325645cf7d2c394d0eaa1628a16a96624f1addcdd1b56c7e8aa2473acfaf07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:36:59,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:36:59,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:36:59,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:36:59,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:36:59,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:36:59,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:36:59,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:36:59,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:36:59,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:36:59,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:36:59,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:36:59,100 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:36:59,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:36:59,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:36:59,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:36:59,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:36:59,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:36:59,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:36:59,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:36:59,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:36:59,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:36:59,101 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:36:59,101 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:36:59,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:36:59,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:36:59,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:36:59,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:36:59,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:36:59,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:36:59,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:36:59,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:59,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:36:59,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:36:59,103 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:36:59,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:36:59,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:36:59,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:36:59,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:36:59,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:36:59,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:36:59,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:36:59,104 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 -> 21325645cf7d2c394d0eaa1628a16a96624f1addcdd1b56c7e8aa2473acfaf07 [2025-02-08 05:36:59,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:36:59,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:36:59,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:36:59,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:36:59,341 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:36:59,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3.wvr.c [2025-02-08 05:37:00,514 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83fd57575/8d24dd72d3c8450e8ae17a7d34f740df/FLAG2b9d7d889 [2025-02-08 05:37:00,747 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:00,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3.wvr.c [2025-02-08 05:37:00,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83fd57575/8d24dd72d3c8450e8ae17a7d34f740df/FLAG2b9d7d889 [2025-02-08 05:37:00,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83fd57575/8d24dd72d3c8450e8ae17a7d34f740df [2025-02-08 05:37:00,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:00,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:00,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:00,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:00,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:00,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4687e745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00, skipping insertion in model container [2025-02-08 05:37:00,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:00,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:00,922 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:00,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:00,948 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:00,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00 WrapperNode [2025-02-08 05:37:00,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:00,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:00,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:00,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:00,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,986 INFO L138 Inliner]: procedures = 21, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 183 [2025-02-08 05:37:00,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:00,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:00,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:00,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:00,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:00,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:01,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:01,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:01,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:01,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:01,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:01,017 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:01,017 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:01,017 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:01,018 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (1/1) ... [2025-02-08 05:37:01,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:01,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:01,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:37:01,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:37:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:01,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:01,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:01,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:01,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:01,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:01,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:01,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:37:01,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:37:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-08 05:37:01,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-08 05:37:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-02-08 05:37:01,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-02-08 05:37:01,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:01,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:01,080 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:01,159 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:01,160 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:01,526 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:01,526 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:01,541 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:01,541 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:01,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:01 BoogieIcfgContainer [2025-02-08 05:37:01,542 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:01,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:01,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:01,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:01,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:00" (1/3) ... [2025-02-08 05:37:01,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c88d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:01, skipping insertion in model container [2025-02-08 05:37:01,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:00" (2/3) ... [2025-02-08 05:37:01,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c88d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:01, skipping insertion in model container [2025-02-08 05:37:01,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:01" (3/3) ... [2025-02-08 05:37:01,549 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2025-02-08 05:37:01,559 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:01,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3.wvr.c that has 7 procedures, 353 locations, 1 initial locations, 6 loop locations, and 52 error locations. [2025-02-08 05:37:01,561 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:01,657 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-02-08 05:37:01,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 371 places, 373 transitions, 788 flow [2025-02-08 05:37:01,806 INFO L124 PetriNetUnfolderBase]: 21/367 cut-off events. [2025-02-08 05:37:01,810 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:01,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 367 events. 21/367 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 722 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 300. Up to 2 conditions per place. [2025-02-08 05:37:01,819 INFO L82 GeneralOperation]: Start removeDead. Operand has 371 places, 373 transitions, 788 flow [2025-02-08 05:37:01,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 346 places, 346 transitions, 728 flow [2025-02-08 05:37:01,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:01,840 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;@10915bba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:01,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2025-02-08 05:37:01,852 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:01,853 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:37:01,853 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:01,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:01,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:01,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash -424482652, now seen corresponding path program 1 times [2025-02-08 05:37:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138197670] [2025-02-08 05:37:01,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:37:01,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:37:01,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138197670] [2025-02-08 05:37:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138197670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239803243] [2025-02-08 05:37:02,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 373 [2025-02-08 05:37:02,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 346 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 373 [2025-02-08 05:37:02,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,333 INFO L124 PetriNetUnfolderBase]: 37/473 cut-off events. [2025-02-08 05:37:02,334 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 05:37:02,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 473 events. 37/473 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1726 event pairs, 20 based on Foata normal form. 91/466 useless extension candidates. Maximal degree in co-relation 485. Up to 68 conditions per place. [2025-02-08 05:37:02,343 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 22 selfloop transitions, 2 changer transitions 1/338 dead transitions. [2025-02-08 05:37:02,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 338 transitions, 760 flow [2025-02-08 05:37:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2025-02-08 05:37:02,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934763181411975 [2025-02-08 05:37:02,361 INFO L175 Difference]: Start difference. First operand has 346 places, 346 transitions, 728 flow. Second operand 3 states and 1046 transitions. [2025-02-08 05:37:02,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 338 transitions, 760 flow [2025-02-08 05:37:02,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 338 transitions, 736 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-08 05:37:02,372 INFO L231 Difference]: Finished difference. Result has 335 places, 337 transitions, 690 flow [2025-02-08 05:37:02,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=335, PETRI_TRANSITIONS=337} [2025-02-08 05:37:02,378 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -11 predicate places. [2025-02-08 05:37:02,379 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 337 transitions, 690 flow [2025-02-08 05:37:02,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:02,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:02,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:02,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash -321414898, now seen corresponding path program 1 times [2025-02-08 05:37:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948949782] [2025-02-08 05:37:02,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 05:37:02,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 05:37:02,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948949782] [2025-02-08 05:37:02,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948949782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114543717] [2025-02-08 05:37:02,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2025-02-08 05:37:02,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 337 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2025-02-08 05:37:02,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,555 INFO L124 PetriNetUnfolderBase]: 37/471 cut-off events. [2025-02-08 05:37:02,556 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:02,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 471 events. 37/471 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1644 event pairs, 20 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 532. Up to 67 conditions per place. [2025-02-08 05:37:02,562 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2025-02-08 05:37:02,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 336 transitions, 734 flow [2025-02-08 05:37:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-02-08 05:37:02,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2025-02-08 05:37:02,564 INFO L175 Difference]: Start difference. First operand has 335 places, 337 transitions, 690 flow. Second operand 3 states and 1041 transitions. [2025-02-08 05:37:02,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 336 transitions, 734 flow [2025-02-08 05:37:02,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 336 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,569 INFO L231 Difference]: Finished difference. Result has 333 places, 336 transitions, 688 flow [2025-02-08 05:37:02,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=333, PETRI_TRANSITIONS=336} [2025-02-08 05:37:02,570 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -13 predicate places. [2025-02-08 05:37:02,570 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 336 transitions, 688 flow [2025-02-08 05:37:02,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:02,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:02,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:02,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1067225927, now seen corresponding path program 1 times [2025-02-08 05:37:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349908879] [2025-02-08 05:37:02,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:37:02,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:37:02,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349908879] [2025-02-08 05:37:02,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349908879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586403705] [2025-02-08 05:37:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 373 [2025-02-08 05:37:02,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 336 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 373 [2025-02-08 05:37:02,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,722 INFO L124 PetriNetUnfolderBase]: 37/452 cut-off events. [2025-02-08 05:37:02,722 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:02,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 452 events. 37/452 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1476 event pairs, 20 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 503. Up to 68 conditions per place. [2025-02-08 05:37:02,727 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 22 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2025-02-08 05:37:02,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 335 transitions, 734 flow [2025-02-08 05:37:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-02-08 05:37:02,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285075960679178 [2025-02-08 05:37:02,729 INFO L175 Difference]: Start difference. First operand has 333 places, 336 transitions, 688 flow. Second operand 3 states and 1039 transitions. [2025-02-08 05:37:02,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 335 transitions, 734 flow [2025-02-08 05:37:02,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 335 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,734 INFO L231 Difference]: Finished difference. Result has 332 places, 335 transitions, 686 flow [2025-02-08 05:37:02,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=332, PETRI_TRANSITIONS=335} [2025-02-08 05:37:02,735 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -14 predicate places. [2025-02-08 05:37:02,735 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 335 transitions, 686 flow [2025-02-08 05:37:02,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:02,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:02,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:02,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,736 INFO L85 PathProgramCache]: Analyzing trace with hash -913033709, now seen corresponding path program 1 times [2025-02-08 05:37:02,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204443305] [2025-02-08 05:37:02,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:37:02,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:37:02,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204443305] [2025-02-08 05:37:02,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204443305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593526024] [2025-02-08 05:37:02,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2025-02-08 05:37:02,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 335 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2025-02-08 05:37:02,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,924 INFO L124 PetriNetUnfolderBase]: 37/433 cut-off events. [2025-02-08 05:37:02,924 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:02,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 433 events. 37/433 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1267 event pairs, 20 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 472. Up to 67 conditions per place. [2025-02-08 05:37:02,930 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2025-02-08 05:37:02,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 334 transitions, 730 flow [2025-02-08 05:37:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-02-08 05:37:02,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2025-02-08 05:37:02,933 INFO L175 Difference]: Start difference. First operand has 332 places, 335 transitions, 686 flow. Second operand 3 states and 1041 transitions. [2025-02-08 05:37:02,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 334 transitions, 730 flow [2025-02-08 05:37:02,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 334 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,937 INFO L231 Difference]: Finished difference. Result has 331 places, 334 transitions, 684 flow [2025-02-08 05:37:02,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=331, PETRI_TRANSITIONS=334} [2025-02-08 05:37:02,938 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -15 predicate places. [2025-02-08 05:37:02,939 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 334 transitions, 684 flow [2025-02-08 05:37:02,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:02,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:02,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:02,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1926518075, now seen corresponding path program 1 times [2025-02-08 05:37:02,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262611358] [2025-02-08 05:37:02,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:37:02,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:37:02,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262611358] [2025-02-08 05:37:02,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262611358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16646979] [2025-02-08 05:37:02,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:03,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 373 [2025-02-08 05:37:03,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 334 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 373 [2025-02-08 05:37:03,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,062 INFO L124 PetriNetUnfolderBase]: 37/414 cut-off events. [2025-02-08 05:37:03,062 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:03,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 414 events. 37/414 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1095 event pairs, 20 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 443. Up to 68 conditions per place. [2025-02-08 05:37:03,067 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 22 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2025-02-08 05:37:03,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 333 transitions, 730 flow [2025-02-08 05:37:03,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-02-08 05:37:03,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285075960679178 [2025-02-08 05:37:03,070 INFO L175 Difference]: Start difference. First operand has 331 places, 334 transitions, 684 flow. Second operand 3 states and 1039 transitions. [2025-02-08 05:37:03,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 333 transitions, 730 flow [2025-02-08 05:37:03,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 333 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:03,074 INFO L231 Difference]: Finished difference. Result has 330 places, 333 transitions, 682 flow [2025-02-08 05:37:03,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=330, PETRI_TRANSITIONS=333} [2025-02-08 05:37:03,075 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -16 predicate places. [2025-02-08 05:37:03,075 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 333 transitions, 682 flow [2025-02-08 05:37:03,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:03,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:03,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:03,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash 569588225, now seen corresponding path program 1 times [2025-02-08 05:37:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530340122] [2025-02-08 05:37:03,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:37:03,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:37:03,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:03,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530340122] [2025-02-08 05:37:03,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530340122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:03,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242942959] [2025-02-08 05:37:03,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:03,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:03,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:03,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2025-02-08 05:37:03,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 333 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2025-02-08 05:37:03,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,191 INFO L124 PetriNetUnfolderBase]: 37/395 cut-off events. [2025-02-08 05:37:03,191 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:03,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 395 events. 37/395 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 925 event pairs, 20 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 412. Up to 67 conditions per place. [2025-02-08 05:37:03,196 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/332 dead transitions. [2025-02-08 05:37:03,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 332 transitions, 726 flow [2025-02-08 05:37:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-02-08 05:37:03,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2025-02-08 05:37:03,198 INFO L175 Difference]: Start difference. First operand has 330 places, 333 transitions, 682 flow. Second operand 3 states and 1041 transitions. [2025-02-08 05:37:03,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 332 transitions, 726 flow [2025-02-08 05:37:03,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 332 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:03,202 INFO L231 Difference]: Finished difference. Result has 329 places, 332 transitions, 680 flow [2025-02-08 05:37:03,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=329, PETRI_TRANSITIONS=332} [2025-02-08 05:37:03,203 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -17 predicate places. [2025-02-08 05:37:03,203 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 332 transitions, 680 flow [2025-02-08 05:37:03,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:03,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:03,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:03,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,205 INFO L85 PathProgramCache]: Analyzing trace with hash -369125190, now seen corresponding path program 1 times [2025-02-08 05:37:03,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667705494] [2025-02-08 05:37:03,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:37:03,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:37:03,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667705494] [2025-02-08 05:37:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667705494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:03,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203004828] [2025-02-08 05:37:03,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:03,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:03,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:03,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2025-02-08 05:37:03,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 332 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2025-02-08 05:37:03,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,785 INFO L124 PetriNetUnfolderBase]: 755/4731 cut-off events. [2025-02-08 05:37:03,786 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-08 05:37:03,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5736 conditions, 4731 events. 755/4731 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 46112 event pairs, 387 based on Foata normal form. 0/3476 useless extension candidates. Maximal degree in co-relation 5667. Up to 936 conditions per place. [2025-02-08 05:37:03,835 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2025-02-08 05:37:03,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 331 transitions, 724 flow [2025-02-08 05:37:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-02-08 05:37:03,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2025-02-08 05:37:03,837 INFO L175 Difference]: Start difference. First operand has 329 places, 332 transitions, 680 flow. Second operand 3 states and 1041 transitions. [2025-02-08 05:37:03,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 331 transitions, 724 flow [2025-02-08 05:37:03,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 331 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:03,842 INFO L231 Difference]: Finished difference. Result has 328 places, 331 transitions, 678 flow [2025-02-08 05:37:03,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=328, PETRI_TRANSITIONS=331} [2025-02-08 05:37:03,843 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -18 predicate places. [2025-02-08 05:37:03,843 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 331 transitions, 678 flow [2025-02-08 05:37:03,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:03,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:03,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:03,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash 999407656, now seen corresponding path program 1 times [2025-02-08 05:37:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241173750] [2025-02-08 05:37:03,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:37:03,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:37:03,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:03,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241173750] [2025-02-08 05:37:03,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241173750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629537841] [2025-02-08 05:37:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:03,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:03,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:03,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 373 [2025-02-08 05:37:03,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 331 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 373 [2025-02-08 05:37:03,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,984 INFO L124 PetriNetUnfolderBase]: 52/461 cut-off events. [2025-02-08 05:37:03,984 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:03,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 461 events. 52/461 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1739 event pairs, 30 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 533. Up to 90 conditions per place. [2025-02-08 05:37:03,989 INFO L140 encePairwiseOnDemand]: 364/373 looper letters, 29 selfloop transitions, 3 changer transitions 0/331 dead transitions. [2025-02-08 05:37:03,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 331 transitions, 747 flow [2025-02-08 05:37:03,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1034 transitions. [2025-02-08 05:37:03,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9240393208221627 [2025-02-08 05:37:03,991 INFO L175 Difference]: Start difference. First operand has 328 places, 331 transitions, 678 flow. Second operand 3 states and 1034 transitions. [2025-02-08 05:37:03,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 331 transitions, 747 flow [2025-02-08 05:37:03,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 331 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:03,997 INFO L231 Difference]: Finished difference. Result has 323 places, 326 transitions, 675 flow [2025-02-08 05:37:03,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=323, PETRI_TRANSITIONS=326} [2025-02-08 05:37:03,998 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -23 predicate places. [2025-02-08 05:37:03,998 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 326 transitions, 675 flow [2025-02-08 05:37:03,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:03,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:03,999 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:03,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1641905716, now seen corresponding path program 1 times [2025-02-08 05:37:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387850980] [2025-02-08 05:37:04,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:37:04,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:37:04,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:04,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387850980] [2025-02-08 05:37:04,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387850980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:04,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229808025] [2025-02-08 05:37:04,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:04,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:04,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 373 [2025-02-08 05:37:04,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 326 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:04,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 373 [2025-02-08 05:37:04,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,133 INFO L124 PetriNetUnfolderBase]: 52/457 cut-off events. [2025-02-08 05:37:04,133 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:37:04,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 457 events. 52/457 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1674 event pairs, 30 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 515. Up to 88 conditions per place. [2025-02-08 05:37:04,138 INFO L140 encePairwiseOnDemand]: 365/373 looper letters, 27 selfloop transitions, 3 changer transitions 0/327 dead transitions. [2025-02-08 05:37:04,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 327 transitions, 742 flow [2025-02-08 05:37:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2025-02-08 05:37:04,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294012511170688 [2025-02-08 05:37:04,140 INFO L175 Difference]: Start difference. First operand has 323 places, 326 transitions, 675 flow. Second operand 3 states and 1040 transitions. [2025-02-08 05:37:04,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 327 transitions, 742 flow [2025-02-08 05:37:04,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 327 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:04,145 INFO L231 Difference]: Finished difference. Result has 320 places, 322 transitions, 675 flow [2025-02-08 05:37:04,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=320, PETRI_TRANSITIONS=322} [2025-02-08 05:37:04,146 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -26 predicate places. [2025-02-08 05:37:04,146 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 322 transitions, 675 flow [2025-02-08 05:37:04,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:04,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:04,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:04,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:04,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1861624601, now seen corresponding path program 1 times [2025-02-08 05:37:04,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:04,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-02-08 05:37:04,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:37:04,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:37:04,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:04,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-02-08 05:37:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113231668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104895249] [2025-02-08 05:37:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:04,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:04,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 373 [2025-02-08 05:37:04,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 322 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:04,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 373 [2025-02-08 05:37:04,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,393 INFO L124 PetriNetUnfolderBase]: 70/752 cut-off events. [2025-02-08 05:37:04,393 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:37:04,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 752 events. 70/752 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3786 event pairs, 25 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 825. Up to 96 conditions per place. [2025-02-08 05:37:04,411 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 32 selfloop transitions, 4 changer transitions 0/326 dead transitions. [2025-02-08 05:37:04,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 326 transitions, 763 flow [2025-02-08 05:37:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2025-02-08 05:37:04,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276139410187667 [2025-02-08 05:37:04,420 INFO L175 Difference]: Start difference. First operand has 320 places, 322 transitions, 675 flow. Second operand 3 states and 1038 transitions. [2025-02-08 05:37:04,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 326 transitions, 763 flow [2025-02-08 05:37:04,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 326 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:04,429 INFO L231 Difference]: Finished difference. Result has 316 places, 318 transitions, 680 flow [2025-02-08 05:37:04,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=316, PETRI_TRANSITIONS=318} [2025-02-08 05:37:04,430 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -30 predicate places. [2025-02-08 05:37:04,430 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 318 transitions, 680 flow [2025-02-08 05:37:04,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:04,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:04,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:04,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:04,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1980141660, now seen corresponding path program 1 times [2025-02-08 05:37:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:04,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073712139] [2025-02-08 05:37:04,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:37:04,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:37:04,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073712139] [2025-02-08 05:37:04,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073712139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:04,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133207783] [2025-02-08 05:37:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:04,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:04,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:04,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 373 [2025-02-08 05:37:04,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 318 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:04,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 373 [2025-02-08 05:37:04,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,655 INFO L124 PetriNetUnfolderBase]: 104/910 cut-off events. [2025-02-08 05:37:04,655 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-08 05:37:04,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 910 events. 104/910 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5037 event pairs, 9 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 875. Up to 151 conditions per place. [2025-02-08 05:37:04,666 INFO L140 encePairwiseOnDemand]: 365/373 looper letters, 31 selfloop transitions, 3 changer transitions 0/323 dead transitions. [2025-02-08 05:37:04,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 323 transitions, 767 flow [2025-02-08 05:37:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1044 transitions. [2025-02-08 05:37:04,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9329758713136729 [2025-02-08 05:37:04,669 INFO L175 Difference]: Start difference. First operand has 316 places, 318 transitions, 680 flow. Second operand 3 states and 1044 transitions. [2025-02-08 05:37:04,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 323 transitions, 767 flow [2025-02-08 05:37:04,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 323 transitions, 763 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:04,675 INFO L231 Difference]: Finished difference. Result has 313 places, 314 transitions, 679 flow [2025-02-08 05:37:04,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=313, PETRI_TRANSITIONS=314} [2025-02-08 05:37:04,676 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -33 predicate places. [2025-02-08 05:37:04,676 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 314 transitions, 679 flow [2025-02-08 05:37:04,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:04,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:04,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:04,677 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:04,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:04,678 INFO L85 PathProgramCache]: Analyzing trace with hash -820636249, now seen corresponding path program 1 times [2025-02-08 05:37:04,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:04,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484778562] [2025-02-08 05:37:04,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:37:04,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:37:04,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:04,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484778562] [2025-02-08 05:37:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484778562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110293548] [2025-02-08 05:37:04,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:04,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:04,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 373 [2025-02-08 05:37:04,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 314 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:04,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 373 [2025-02-08 05:37:04,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,981 INFO L124 PetriNetUnfolderBase]: 153/1421 cut-off events. [2025-02-08 05:37:04,981 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-02-08 05:37:04,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1421 events. 153/1421 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9633 event pairs, 12 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 1329. Up to 235 conditions per place. [2025-02-08 05:37:04,991 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 34 selfloop transitions, 4 changer transitions 0/320 dead transitions. [2025-02-08 05:37:04,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 320 transitions, 777 flow [2025-02-08 05:37:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2025-02-08 05:37:04,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294012511170688 [2025-02-08 05:37:04,993 INFO L175 Difference]: Start difference. First operand has 313 places, 314 transitions, 679 flow. Second operand 3 states and 1040 transitions. [2025-02-08 05:37:04,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 320 transitions, 777 flow [2025-02-08 05:37:04,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 320 transitions, 774 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:04,999 INFO L231 Difference]: Finished difference. Result has 309 places, 310 transitions, 684 flow [2025-02-08 05:37:04,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=309, PETRI_TRANSITIONS=310} [2025-02-08 05:37:05,000 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -37 predicate places. [2025-02-08 05:37:05,001 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 310 transitions, 684 flow [2025-02-08 05:37:05,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:05,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:05,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:05,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:05,002 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:05,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:05,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1642561530, now seen corresponding path program 1 times [2025-02-08 05:37:05,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:05,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831082378] [2025-02-08 05:37:05,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:05,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:05,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:37:05,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:37:05,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:05,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:05,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831082378] [2025-02-08 05:37:05,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831082378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:05,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:05,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880045709] [2025-02-08 05:37:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:05,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:05,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:05,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:05,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 373 [2025-02-08 05:37:05,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 310 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:05,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:05,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 373 [2025-02-08 05:37:05,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:05,234 INFO L124 PetriNetUnfolderBase]: 222/1843 cut-off events. [2025-02-08 05:37:05,235 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-08 05:37:05,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 1843 events. 222/1843 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 13605 event pairs, 95 based on Foata normal form. 1/1698 useless extension candidates. Maximal degree in co-relation 1714. Up to 332 conditions per place. [2025-02-08 05:37:05,252 INFO L140 encePairwiseOnDemand]: 365/373 looper letters, 30 selfloop transitions, 3 changer transitions 18/317 dead transitions. [2025-02-08 05:37:05,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 317 transitions, 779 flow [2025-02-08 05:37:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2025-02-08 05:37:05,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9338695263628239 [2025-02-08 05:37:05,254 INFO L175 Difference]: Start difference. First operand has 309 places, 310 transitions, 684 flow. Second operand 3 states and 1045 transitions. [2025-02-08 05:37:05,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 317 transitions, 779 flow [2025-02-08 05:37:05,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 317 transitions, 775 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:05,259 INFO L231 Difference]: Finished difference. Result has 306 places, 288 transitions, 646 flow [2025-02-08 05:37:05,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=306, PETRI_TRANSITIONS=288} [2025-02-08 05:37:05,260 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -40 predicate places. [2025-02-08 05:37:05,260 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 288 transitions, 646 flow [2025-02-08 05:37:05,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:05,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:05,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:05,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:05,262 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1851812622, now seen corresponding path program 1 times [2025-02-08 05:37:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168504521] [2025-02-08 05:37:05,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:05,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:37:05,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:37:05,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:05,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:05,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:05,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168504521] [2025-02-08 05:37:05,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168504521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:05,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:05,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:05,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098414653] [2025-02-08 05:37:05,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:05,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:05,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:05,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:05,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:05,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 373 [2025-02-08 05:37:05,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 288 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:05,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:05,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 373 [2025-02-08 05:37:05,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,176 INFO L124 PetriNetUnfolderBase]: 18691/70752 cut-off events. [2025-02-08 05:37:12,176 INFO L125 PetriNetUnfolderBase]: For 1780/1780 co-relation queries the response was YES. [2025-02-08 05:37:12,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102346 conditions, 70752 events. 18691/70752 cut-off events. For 1780/1780 co-relation queries the response was YES. Maximal size of possible extension queue 2557. Compared 1065795 event pairs, 9985 based on Foata normal form. 0/60889 useless extension candidates. Maximal degree in co-relation 36296. Up to 23154 conditions per place. [2025-02-08 05:37:13,023 INFO L140 encePairwiseOnDemand]: 361/373 looper letters, 29 selfloop transitions, 6 changer transitions 0/293 dead transitions. [2025-02-08 05:37:13,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 293 transitions, 731 flow [2025-02-08 05:37:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2025-02-08 05:37:13,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294012511170688 [2025-02-08 05:37:13,026 INFO L175 Difference]: Start difference. First operand has 306 places, 288 transitions, 646 flow. Second operand 3 states and 1040 transitions. [2025-02-08 05:37:13,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 293 transitions, 731 flow [2025-02-08 05:37:13,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 293 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:13,113 INFO L231 Difference]: Finished difference. Result has 285 places, 288 transitions, 673 flow [2025-02-08 05:37:13,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=285, PETRI_TRANSITIONS=288} [2025-02-08 05:37:13,115 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -61 predicate places. [2025-02-08 05:37:13,115 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 288 transitions, 673 flow [2025-02-08 05:37:13,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:13,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:13,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:13,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:13,116 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:13,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash -112665568, now seen corresponding path program 1 times [2025-02-08 05:37:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622109940] [2025-02-08 05:37:13,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:13,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:37:13,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:37:13,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:13,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:13,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622109940] [2025-02-08 05:37:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622109940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:13,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:13,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16997762] [2025-02-08 05:37:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:13,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:13,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:13,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:13,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 373 [2025-02-08 05:37:13,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 288 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:13,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:13,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 373 [2025-02-08 05:37:13,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,438 INFO L124 PetriNetUnfolderBase]: 2051/10608 cut-off events. [2025-02-08 05:37:14,438 INFO L125 PetriNetUnfolderBase]: For 73/109 co-relation queries the response was YES. [2025-02-08 05:37:14,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15083 conditions, 10608 events. 2051/10608 cut-off events. For 73/109 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 128459 event pairs, 546 based on Foata normal form. 0/9028 useless extension candidates. Maximal degree in co-relation 8297. Up to 2106 conditions per place. [2025-02-08 05:37:14,516 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 25 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-02-08 05:37:14,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 292 transitions, 740 flow [2025-02-08 05:37:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2025-02-08 05:37:14,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.935656836461126 [2025-02-08 05:37:14,518 INFO L175 Difference]: Start difference. First operand has 285 places, 288 transitions, 673 flow. Second operand 3 states and 1047 transitions. [2025-02-08 05:37:14,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 292 transitions, 740 flow [2025-02-08 05:37:14,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 292 transitions, 740 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:14,524 INFO L231 Difference]: Finished difference. Result has 286 places, 287 transitions, 675 flow [2025-02-08 05:37:14,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=286, PETRI_TRANSITIONS=287} [2025-02-08 05:37:14,526 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -60 predicate places. [2025-02-08 05:37:14,526 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 287 transitions, 675 flow [2025-02-08 05:37:14,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:14,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:14,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:14,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:14,527 INFO L85 PathProgramCache]: Analyzing trace with hash 867138419, now seen corresponding path program 1 times [2025-02-08 05:37:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:14,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920327326] [2025-02-08 05:37:14,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:14,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 05:37:14,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 05:37:14,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:14,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:14,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920327326] [2025-02-08 05:37:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920327326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:14,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:14,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828591664] [2025-02-08 05:37:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:14,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:14,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:14,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:14,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 373 [2025-02-08 05:37:14,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 287 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:14,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 373 [2025-02-08 05:37:14,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,848 INFO L124 PetriNetUnfolderBase]: 3759/16543 cut-off events. [2025-02-08 05:37:16,849 INFO L125 PetriNetUnfolderBase]: For 424/448 co-relation queries the response was YES. [2025-02-08 05:37:16,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25366 conditions, 16543 events. 3759/16543 cut-off events. For 424/448 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 212602 event pairs, 1349 based on Foata normal form. 0/14636 useless extension candidates. Maximal degree in co-relation 24577. Up to 2985 conditions per place. [2025-02-08 05:37:17,012 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 24 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-02-08 05:37:17,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 291 transitions, 740 flow [2025-02-08 05:37:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2025-02-08 05:37:17,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9374441465594281 [2025-02-08 05:37:17,015 INFO L175 Difference]: Start difference. First operand has 286 places, 287 transitions, 675 flow. Second operand 3 states and 1049 transitions. [2025-02-08 05:37:17,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 291 transitions, 740 flow [2025-02-08 05:37:17,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 291 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:17,023 INFO L231 Difference]: Finished difference. Result has 285 places, 286 transitions, 673 flow [2025-02-08 05:37:17,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=285, PETRI_TRANSITIONS=286} [2025-02-08 05:37:17,023 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -61 predicate places. [2025-02-08 05:37:17,023 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 286 transitions, 673 flow [2025-02-08 05:37:17,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:17,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:17,024 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:17,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2051779676, now seen corresponding path program 1 times [2025-02-08 05:37:17,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815740592] [2025-02-08 05:37:17,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 05:37:17,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 05:37:17,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:17,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:17,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:17,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815740592] [2025-02-08 05:37:17,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815740592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:17,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:17,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935505253] [2025-02-08 05:37:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:17,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:17,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 373 [2025-02-08 05:37:17,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 286 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 343.3333333333333) internal successors, (1030), 3 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:17,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 373 [2025-02-08 05:37:17,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,479 INFO L124 PetriNetUnfolderBase]: 2995/13364 cut-off events. [2025-02-08 05:37:18,479 INFO L125 PetriNetUnfolderBase]: For 600/618 co-relation queries the response was YES. [2025-02-08 05:37:18,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20383 conditions, 13364 events. 2995/13364 cut-off events. For 600/618 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 164594 event pairs, 967 based on Foata normal form. 0/11835 useless extension candidates. Maximal degree in co-relation 18772. Up to 2501 conditions per place. [2025-02-08 05:37:18,678 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 26 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2025-02-08 05:37:18,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 290 transitions, 742 flow [2025-02-08 05:37:18,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2025-02-08 05:37:18,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.935656836461126 [2025-02-08 05:37:18,680 INFO L175 Difference]: Start difference. First operand has 285 places, 286 transitions, 673 flow. Second operand 3 states and 1047 transitions. [2025-02-08 05:37:18,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 290 transitions, 742 flow [2025-02-08 05:37:18,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 290 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:18,690 INFO L231 Difference]: Finished difference. Result has 284 places, 285 transitions, 671 flow [2025-02-08 05:37:18,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=671, PETRI_PLACES=284, PETRI_TRANSITIONS=285} [2025-02-08 05:37:18,690 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -62 predicate places. [2025-02-08 05:37:18,690 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 285 transitions, 671 flow [2025-02-08 05:37:18,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.3333333333333) internal successors, (1030), 3 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:18,691 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:18,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1883816422, now seen corresponding path program 1 times [2025-02-08 05:37:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617428938] [2025-02-08 05:37:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-08 05:37:18,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 05:37:18,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:18,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617428938] [2025-02-08 05:37:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617428938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009733525] [2025-02-08 05:37:18,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:18,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:18,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 373 [2025-02-08 05:37:18,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 285 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 344.6666666666667) internal successors, (1034), 3 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 373 [2025-02-08 05:37:18,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,936 INFO L124 PetriNetUnfolderBase]: 2558/11279 cut-off events. [2025-02-08 05:37:19,937 INFO L125 PetriNetUnfolderBase]: For 627/658 co-relation queries the response was YES. [2025-02-08 05:37:20,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17328 conditions, 11279 events. 2558/11279 cut-off events. For 627/658 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 134338 event pairs, 853 based on Foata normal form. 3/10054 useless extension candidates. Maximal degree in co-relation 16148. Up to 2146 conditions per place. [2025-02-08 05:37:20,107 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 24 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-02-08 05:37:20,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 289 transitions, 736 flow [2025-02-08 05:37:20,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2025-02-08 05:37:20,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9374441465594281 [2025-02-08 05:37:20,109 INFO L175 Difference]: Start difference. First operand has 284 places, 285 transitions, 671 flow. Second operand 3 states and 1049 transitions. [2025-02-08 05:37:20,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 289 transitions, 736 flow [2025-02-08 05:37:20,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 289 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:20,122 INFO L231 Difference]: Finished difference. Result has 283 places, 284 transitions, 669 flow [2025-02-08 05:37:20,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=283, PETRI_TRANSITIONS=284} [2025-02-08 05:37:20,123 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -63 predicate places. [2025-02-08 05:37:20,123 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 284 transitions, 669 flow [2025-02-08 05:37:20,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.6666666666667) internal successors, (1034), 3 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:20,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:20,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:20,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:20,124 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:20,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1237688810, now seen corresponding path program 1 times [2025-02-08 05:37:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:20,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634670135] [2025-02-08 05:37:20,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:20,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:20,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 05:37:20,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 05:37:20,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:20,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:20,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:20,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634670135] [2025-02-08 05:37:20,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634670135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:20,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:20,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:20,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137942973] [2025-02-08 05:37:20,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:20,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:20,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:20,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:20,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:20,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 373 [2025-02-08 05:37:20,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 284 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:20,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 373 [2025-02-08 05:37:20,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,455 INFO L124 PetriNetUnfolderBase]: 2003/9395 cut-off events. [2025-02-08 05:37:21,455 INFO L125 PetriNetUnfolderBase]: For 551/595 co-relation queries the response was YES. [2025-02-08 05:37:21,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13854 conditions, 9395 events. 2003/9395 cut-off events. For 551/595 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 107471 event pairs, 626 based on Foata normal form. 5/8300 useless extension candidates. Maximal degree in co-relation 12671. Up to 1876 conditions per place. [2025-02-08 05:37:21,588 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 26 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-02-08 05:37:21,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 288 transitions, 738 flow [2025-02-08 05:37:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2025-02-08 05:37:21,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.935656836461126 [2025-02-08 05:37:21,591 INFO L175 Difference]: Start difference. First operand has 283 places, 284 transitions, 669 flow. Second operand 3 states and 1047 transitions. [2025-02-08 05:37:21,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 288 transitions, 738 flow [2025-02-08 05:37:21,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 288 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:21,601 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 667 flow [2025-02-08 05:37:21,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=667, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2025-02-08 05:37:21,604 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -64 predicate places. [2025-02-08 05:37:21,604 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 667 flow [2025-02-08 05:37:21,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:21,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:21,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:21,606 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2025-02-08 05:37:21,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1896581218, now seen corresponding path program 1 times [2025-02-08 05:37:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700130530] [2025-02-08 05:37:21,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 05:37:21,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:37:21,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:21,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700130530] [2025-02-08 05:37:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700130530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435199135] [2025-02-08 05:37:21,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 373 [2025-02-08 05:37:21,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 345.3333333333333) internal successors, (1036), 3 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:21,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 373 [2025-02-08 05:37:21,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,622 INFO L124 PetriNetUnfolderBase]: 1397/7322 cut-off events. [2025-02-08 05:37:22,623 INFO L125 PetriNetUnfolderBase]: For 276/304 co-relation queries the response was YES. [2025-02-08 05:37:22,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10325 conditions, 7322 events. 1397/7322 cut-off events. For 276/304 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 79826 event pairs, 375 based on Foata normal form. 4/6484 useless extension candidates. Maximal degree in co-relation 9695. Up to 1480 conditions per place. [2025-02-08 05:37:22,685 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2025-02-08 05:37:22,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 287 transitions, 732 flow [2025-02-08 05:37:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2025-02-08 05:37:22,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9374441465594281 [2025-02-08 05:37:22,687 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 667 flow. Second operand 3 states and 1049 transitions. [2025-02-08 05:37:22,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 287 transitions, 732 flow [2025-02-08 05:37:22,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 287 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:22,693 INFO L231 Difference]: Finished difference. Result has 281 places, 0 transitions, 0 flow [2025-02-08 05:37:22,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=281, PETRI_TRANSITIONS=0} [2025-02-08 05:37:22,693 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -65 predicate places. [2025-02-08 05:37:22,693 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 0 transitions, 0 flow [2025-02-08 05:37:22,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 345.3333333333333) internal successors, (1036), 3 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:22,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (87 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (86 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (85 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (84 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (83 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (82 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (81 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (80 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (79 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (78 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (77 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (76 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (75 of 88 remaining) [2025-02-08 05:37:22,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (74 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (73 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (72 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (71 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (70 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (68 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (67 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (66 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (65 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (64 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (63 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (62 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (61 of 88 remaining) [2025-02-08 05:37:22,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 88 remaining) [2025-02-08 05:37:22,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (59 of 88 remaining) [2025-02-08 05:37:22,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (58 of 88 remaining) [2025-02-08 05:37:22,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (57 of 88 remaining) [2025-02-08 05:37:22,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (56 of 88 remaining) [2025-02-08 05:37:22,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (55 of 88 remaining) [2025-02-08 05:37:22,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (54 of 88 remaining) [2025-02-08 05:37:22,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 88 remaining) [2025-02-08 05:37:22,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (51 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (44 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (43 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (41 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (40 of 88 remaining) [2025-02-08 05:37:22,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (39 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (38 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (36 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (35 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (34 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (33 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (31 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (30 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (25 of 88 remaining) [2025-02-08 05:37:22,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (24 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (23 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (19 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (14 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (13 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (11 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 88 remaining) [2025-02-08 05:37:22,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (9 of 88 remaining) [2025-02-08 05:37:22,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (8 of 88 remaining) [2025-02-08 05:37:22,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 88 remaining) [2025-02-08 05:37:22,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 88 remaining) [2025-02-08 05:37:22,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (5 of 88 remaining) [2025-02-08 05:37:22,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (4 of 88 remaining) [2025-02-08 05:37:22,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 88 remaining) [2025-02-08 05:37:22,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 88 remaining) [2025-02-08 05:37:22,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 88 remaining) [2025-02-08 05:37:22,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 88 remaining) [2025-02-08 05:37:22,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:22,702 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:22,706 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:22,706 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:22,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:22 BasicIcfg [2025-02-08 05:37:22,709 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:22,710 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:22,710 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:22,710 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:22,710 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:01" (3/4) ... [2025-02-08 05:37:22,711 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:22,713 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:22,713 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:22,713 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:22,714 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:37:22,714 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-02-08 05:37:22,714 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-02-08 05:37:22,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-08 05:37:22,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 05:37:22,718 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:37:22,718 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:22,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:22,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:22,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:22,777 INFO L158 Benchmark]: Toolchain (without parser) took 21984.94ms. Allocated memory was 201.3MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 155.5MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-02-08 05:37:22,777 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 218.1MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:22,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.88ms. Allocated memory is still 201.3MB. Free memory was 155.5MB in the beginning and 142.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:22,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.74ms. Allocated memory is still 201.3MB. Free memory was 142.9MB in the beginning and 141.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:22,778 INFO L158 Benchmark]: Boogie Preprocessor took 24.47ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 140.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:22,778 INFO L158 Benchmark]: IcfgBuilder took 524.99ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 114.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:22,778 INFO L158 Benchmark]: TraceAbstraction took 21165.75ms. Allocated memory was 201.3MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 113.8MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-02-08 05:37:22,779 INFO L158 Benchmark]: Witness Printer took 67.21ms. Allocated memory is still 7.7GB. Free memory was 4.8GB in the beginning and 4.8GB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:22,780 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 218.1MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.88ms. Allocated memory is still 201.3MB. Free memory was 155.5MB in the beginning and 142.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.74ms. Allocated memory is still 201.3MB. Free memory was 142.9MB in the beginning and 141.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.47ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 140.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 524.99ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 114.4MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21165.75ms. Allocated memory was 201.3MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 113.8MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 67.21ms. Allocated memory is still 7.7GB. Free memory was 4.8GB in the beginning and 4.8GB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 497 locations, 88 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: 21.0s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1010 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1169 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 202 mSDtfsCounter, 1169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=0, InterpolantAutomatonStates: 60, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1679 NumberOfCodeBlocks, 1679 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1659 ConstructedInterpolants, 0 QuantifiedInterpolants, 1699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 - AllSpecificationsHoldResult: All specifications hold 52 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:22,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE