./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_safe-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/fib_safe-10.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d0c5b9355e30d5caa4f24695b56ab4fa8d9d282078ca8b4e24a8f9b8920e450 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:01:56,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:01:56,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:01:56,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:01:56,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:01:56,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:01:56,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:01:56,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:01:56,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:01:56,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:01:56,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:01:56,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:01:56,568 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:01:56,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:01:56,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:01:56,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:01:56,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:01:56,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:01:56,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:01:56,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:01:56,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:01:56,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:01:56,570 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:01:56,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:01:56,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:01:56,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:01:56,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:01:56,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:01:56,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:01:56,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:01:56,570 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 -> 4d0c5b9355e30d5caa4f24695b56ab4fa8d9d282078ca8b4e24a8f9b8920e450 [2025-01-09 21:01:56,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:01:56,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:01:56,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:01:56,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:01:56,807 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:01:56,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_safe-10.i [2025-01-09 21:01:57,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/185d7bf95/1940d8edca8848a099af0696b9f1b9b4/FLAGcab57510f [2025-01-09 21:01:58,247 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:01:58,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/fib_safe-10.i [2025-01-09 21:01:58,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/185d7bf95/1940d8edca8848a099af0696b9f1b9b4/FLAGcab57510f [2025-01-09 21:01:58,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/185d7bf95/1940d8edca8848a099af0696b9f1b9b4 [2025-01-09 21:01:58,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:01:58,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:01:58,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:01:58,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:01:58,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:01:58,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b32d127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58, skipping insertion in model container [2025-01-09 21:01:58,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:01:58,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:01:58,857 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:01:58,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:01:58,924 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:01:58,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58 WrapperNode [2025-01-09 21:01:58,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:01:58,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:01:58,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:01:58,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:01:58,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,949 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2025-01-09 21:01:58,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:01:58,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:01:58,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:01:58,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:01:58,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:01:58,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:01:58,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:01:58,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:01:58,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (1/1) ... [2025-01-09 21:01:58,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:01:58,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:01:59,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:01:59,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:01:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-09 21:01:59,027 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-09 21:01:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-09 21:01:59,027 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-09 21:01:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:01:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:01:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:01:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:01:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:01:59,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:01:59,029 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:01:59,120 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:01:59,121 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:01:59,305 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:01:59,305 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:01:59,367 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:01:59,367 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:01:59,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:01:59 BoogieIcfgContainer [2025-01-09 21:01:59,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:01:59,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:01:59,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:01:59,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:01:59,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:01:58" (1/3) ... [2025-01-09 21:01:59,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1887a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:01:59, skipping insertion in model container [2025-01-09 21:01:59,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:01:58" (2/3) ... [2025-01-09 21:01:59,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1887a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:01:59, skipping insertion in model container [2025-01-09 21:01:59,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:01:59" (3/3) ... [2025-01-09 21:01:59,375 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-10.i [2025-01-09 21:01:59,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:01:59,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-10.i that has 3 procedures, 176 locations, 1 initial locations, 3 loop locations, and 30 error locations. [2025-01-09 21:01:59,386 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:01:59,451 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:01:59,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 183 transitions, 374 flow [2025-01-09 21:01:59,535 INFO L124 PetriNetUnfolderBase]: 8/181 cut-off events. [2025-01-09 21:01:59,539 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:01:59,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 8/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 155. Up to 2 conditions per place. [2025-01-09 21:01:59,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 183 transitions, 374 flow [2025-01-09 21:01:59,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 181 transitions, 368 flow [2025-01-09 21:01:59,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:01:59,572 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;@39585d93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:01:59,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-01-09 21:01:59,583 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:01:59,585 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-01-09 21:01:59,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:01:59,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:01:59,586 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] [2025-01-09 21:01:59,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:01:59,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:01:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1870938818, now seen corresponding path program 1 times [2025-01-09 21:01:59,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:01:59,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037914252] [2025-01-09 21:01:59,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:01:59,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:01:59,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:01:59,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:59,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:01:59,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:01:59,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037914252] [2025-01-09 21:01:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037914252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:01:59,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:01:59,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:01:59,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825782120] [2025-01-09 21:01:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:01:59,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:01:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:01:59,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:01:59,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:01:59,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 183 [2025-01-09 21:01:59,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 181 transitions, 368 flow. Second operand has 2 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:01:59,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:01:59,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 183 [2025-01-09 21:01:59,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:01:59,844 INFO L124 PetriNetUnfolderBase]: 13/317 cut-off events. [2025-01-09 21:01:59,844 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:01:59,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 317 events. 13/317 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1155 event pairs, 6 based on Foata normal form. 22/285 useless extension candidates. Maximal degree in co-relation 312. Up to 21 conditions per place. [2025-01-09 21:01:59,848 INFO L140 encePairwiseOnDemand]: 168/183 looper letters, 7 selfloop transitions, 0 changer transitions 0/164 dead transitions. [2025-01-09 21:01:59,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 348 flow [2025-01-09 21:01:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:01:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:01:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 342 transitions. [2025-01-09 21:01:59,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344262295081968 [2025-01-09 21:01:59,864 INFO L175 Difference]: Start difference. First operand has 180 places, 181 transitions, 368 flow. Second operand 2 states and 342 transitions. [2025-01-09 21:01:59,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 348 flow [2025-01-09 21:01:59,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:01:59,872 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 332 flow [2025-01-09 21:01:59,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=332, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2025-01-09 21:01:59,876 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -13 predicate places. [2025-01-09 21:01:59,876 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 332 flow [2025-01-09 21:01:59,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:01:59,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:01:59,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:01:59,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:01:59,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:01:59,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:01:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1617864077, now seen corresponding path program 1 times [2025-01-09 21:01:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:01:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892783813] [2025-01-09 21:01:59,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:01:59,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:01:59,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:01:59,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:59,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:01:59,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:01:59,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892783813] [2025-01-09 21:01:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892783813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:01:59,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:01:59,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:01:59,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866279764] [2025-01-09 21:01:59,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:01:59,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:01:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:01:59,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:01:59,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:01:59,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:01:59,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:01:59,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:01:59,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:01:59,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:00,059 INFO L124 PetriNetUnfolderBase]: 63/594 cut-off events. [2025-01-09 21:02:00,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:00,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 594 events. 63/594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3247 event pairs, 29 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 716. Up to 81 conditions per place. [2025-01-09 21:02:00,065 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-01-09 21:02:00,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 372 flow [2025-01-09 21:02:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:02:00,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-01-09 21:02:00,067 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 332 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:02:00,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 372 flow [2025-01-09 21:02:00,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 372 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:00,070 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 334 flow [2025-01-09 21:02:00,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2025-01-09 21:02:00,071 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -12 predicate places. [2025-01-09 21:02:00,071 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 334 flow [2025-01-09 21:02:00,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:00,072 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] [2025-01-09 21:02:00,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:02:00,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:00,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:00,072 INFO L85 PathProgramCache]: Analyzing trace with hash -333755420, now seen corresponding path program 1 times [2025-01-09 21:02:00,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:00,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988392680] [2025-01-09 21:02:00,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:00,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:00,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:02:00,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:02:00,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:00,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:00,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:00,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988392680] [2025-01-09 21:02:00,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988392680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:00,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156815162] [2025-01-09 21:02:00,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:00,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:00,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:00,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:00,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:00,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:00,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:00,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:00,192 INFO L124 PetriNetUnfolderBase]: 50/334 cut-off events. [2025-01-09 21:02:00,192 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:02:00,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 334 events. 50/334 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1533 event pairs, 11 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 447. Up to 55 conditions per place. [2025-01-09 21:02:00,196 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-01-09 21:02:00,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 370 flow [2025-01-09 21:02:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:02:00,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-01-09 21:02:00,201 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 334 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:02:00,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 370 flow [2025-01-09 21:02:00,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:00,204 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 330 flow [2025-01-09 21:02:00,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2025-01-09 21:02:00,206 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -14 predicate places. [2025-01-09 21:02:00,206 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 330 flow [2025-01-09 21:02:00,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:00,207 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] [2025-01-09 21:02:00,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:02:00,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:00,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1956789223, now seen corresponding path program 1 times [2025-01-09 21:02:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:00,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442627402] [2025-01-09 21:02:00,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:00,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:02:00,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:02:00,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:00,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:00,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:00,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442627402] [2025-01-09 21:02:00,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442627402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:00,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:00,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691358272] [2025-01-09 21:02:00,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:00,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:00,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:00,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:00,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:00,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:00,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:00,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:00,382 INFO L124 PetriNetUnfolderBase]: 41/346 cut-off events. [2025-01-09 21:02:00,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:00,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 346 events. 41/346 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1665 event pairs, 26 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 428. Up to 59 conditions per place. [2025-01-09 21:02:00,385 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2025-01-09 21:02:00,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 162 transitions, 364 flow [2025-01-09 21:02:00,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:02:00,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-01-09 21:02:00,388 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 330 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:02:00,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 162 transitions, 364 flow [2025-01-09 21:02:00,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 162 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:00,391 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 328 flow [2025-01-09 21:02:00,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-01-09 21:02:00,392 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -15 predicate places. [2025-01-09 21:02:00,393 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 328 flow [2025-01-09 21:02:00,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:00,393 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-01-09 21:02:00,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:02:00,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:00,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:00,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1791913312, now seen corresponding path program 1 times [2025-01-09 21:02:00,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:00,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708422519] [2025-01-09 21:02:00,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:00,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:00,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:02:00,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:02:00,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:00,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:00,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:00,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708422519] [2025-01-09 21:02:00,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708422519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:00,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:00,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:00,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207363422] [2025-01-09 21:02:00,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:00,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:00,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:00,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:00,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:00,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2025-01-09 21:02:00,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:00,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2025-01-09 21:02:00,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:00,598 INFO L124 PetriNetUnfolderBase]: 65/510 cut-off events. [2025-01-09 21:02:00,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:00,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 510 events. 65/510 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2800 event pairs, 24 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 626. Up to 87 conditions per place. [2025-01-09 21:02:00,601 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 16 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2025-01-09 21:02:00,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 161 transitions, 366 flow [2025-01-09 21:02:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-01-09 21:02:00,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-01-09 21:02:00,603 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 328 flow. Second operand 3 states and 469 transitions. [2025-01-09 21:02:00,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 161 transitions, 366 flow [2025-01-09 21:02:00,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:00,607 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 326 flow [2025-01-09 21:02:00,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=164, PETRI_TRANSITIONS=159} [2025-01-09 21:02:00,608 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -16 predicate places. [2025-01-09 21:02:00,608 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 326 flow [2025-01-09 21:02:00,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:00,608 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-01-09 21:02:00,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:02:00,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:00,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash -882814040, now seen corresponding path program 1 times [2025-01-09 21:02:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226271784] [2025-01-09 21:02:00,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:00,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:02:00,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:02:00,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:00,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:00,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:00,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226271784] [2025-01-09 21:02:00,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226271784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:00,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:00,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151481528] [2025-01-09 21:02:00,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:00,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:00,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:00,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:00,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:00,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:00,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:00,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:00,719 INFO L124 PetriNetUnfolderBase]: 37/358 cut-off events. [2025-01-09 21:02:00,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:00,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 358 events. 37/358 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1738 event pairs, 16 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 434. Up to 40 conditions per place. [2025-01-09 21:02:00,726 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 13 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-01-09 21:02:00,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 356 flow [2025-01-09 21:02:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:02:00,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-01-09 21:02:00,727 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 326 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:02:00,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 159 transitions, 356 flow [2025-01-09 21:02:00,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:00,732 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 322 flow [2025-01-09 21:02:00,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-01-09 21:02:00,733 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -18 predicate places. [2025-01-09 21:02:00,733 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 322 flow [2025-01-09 21:02:00,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:00,733 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] [2025-01-09 21:02:00,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:02:00,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:00,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash -740559985, now seen corresponding path program 1 times [2025-01-09 21:02:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:00,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296580269] [2025-01-09 21:02:00,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:00,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:02:00,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:02:00,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:00,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:00,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:00,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296580269] [2025-01-09 21:02:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296580269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:00,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116431696] [2025-01-09 21:02:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:00,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:00,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:00,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:00,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:00,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:00,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:00,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:00,820 INFO L124 PetriNetUnfolderBase]: 37/428 cut-off events. [2025-01-09 21:02:00,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:00,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 428 events. 37/428 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2086 event pairs, 10 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 504. Up to 40 conditions per place. [2025-01-09 21:02:00,822 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-01-09 21:02:00,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 352 flow [2025-01-09 21:02:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:02:00,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-01-09 21:02:00,824 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 322 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:02:00,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 352 flow [2025-01-09 21:02:00,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:00,826 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 318 flow [2025-01-09 21:02:00,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2025-01-09 21:02:00,826 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -20 predicate places. [2025-01-09 21:02:00,826 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 318 flow [2025-01-09 21:02:00,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:00,827 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] [2025-01-09 21:02:00,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:02:00,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:00,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:00,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1270440170, now seen corresponding path program 1 times [2025-01-09 21:02:00,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:00,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599799681] [2025-01-09 21:02:00,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:00,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:00,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:02:00,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:02:00,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:00,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:00,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:00,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599799681] [2025-01-09 21:02:00,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599799681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:00,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:00,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:00,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925608398] [2025-01-09 21:02:00,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:00,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:00,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:00,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:00,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:00,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:00,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:00,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:00,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:00,924 INFO L124 PetriNetUnfolderBase]: 52/363 cut-off events. [2025-01-09 21:02:00,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:00,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 363 events. 52/363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1676 event pairs, 26 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 476. Up to 72 conditions per place. [2025-01-09 21:02:00,927 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-01-09 21:02:00,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 358 flow [2025-01-09 21:02:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-09 21:02:00,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2025-01-09 21:02:00,928 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 318 flow. Second operand 3 states and 474 transitions. [2025-01-09 21:02:00,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 358 flow [2025-01-09 21:02:00,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:00,930 INFO L231 Difference]: Finished difference. Result has 159 places, 154 transitions, 316 flow [2025-01-09 21:02:00,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=159, PETRI_TRANSITIONS=154} [2025-01-09 21:02:00,931 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -21 predicate places. [2025-01-09 21:02:00,931 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 154 transitions, 316 flow [2025-01-09 21:02:00,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:00,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:00,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:02:00,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:00,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1224910392, now seen corresponding path program 1 times [2025-01-09 21:02:00,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:00,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663324648] [2025-01-09 21:02:00,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:00,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:00,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:02:00,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:02:00,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:00,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:00,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663324648] [2025-01-09 21:02:00,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663324648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:00,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:00,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:02:00,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784738481] [2025-01-09 21:02:00,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:00,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:00,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:00,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:00,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2025-01-09 21:02:00,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 154 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:00,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:00,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2025-01-09 21:02:00,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:01,029 INFO L124 PetriNetUnfolderBase]: 25/567 cut-off events. [2025-01-09 21:02:01,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:01,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 567 events. 25/567 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2470 event pairs, 6 based on Foata normal form. 4/495 useless extension candidates. Maximal degree in co-relation 622. Up to 29 conditions per place. [2025-01-09 21:02:01,033 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-01-09 21:02:01,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 350 flow [2025-01-09 21:02:01,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-01-09 21:02:01,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8797814207650273 [2025-01-09 21:02:01,034 INFO L175 Difference]: Start difference. First operand has 159 places, 154 transitions, 316 flow. Second operand 3 states and 483 transitions. [2025-01-09 21:02:01,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 350 flow [2025-01-09 21:02:01,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:01,036 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 324 flow [2025-01-09 21:02:01,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2025-01-09 21:02:01,037 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -20 predicate places. [2025-01-09 21:02:01,037 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 324 flow [2025-01-09 21:02:01,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:01,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:02:01,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:01,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1224909367, now seen corresponding path program 1 times [2025-01-09 21:02:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:01,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633212525] [2025-01-09 21:02:01,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:01,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:01,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:02:01,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:02:01,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:01,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633212525] [2025-01-09 21:02:01,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633212525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:01,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:01,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:01,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765176317] [2025-01-09 21:02:01,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:01,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:01,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:01,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:01,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 183 [2025-01-09 21:02:01,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:01,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 183 [2025-01-09 21:02:01,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:01,119 INFO L124 PetriNetUnfolderBase]: 57/553 cut-off events. [2025-01-09 21:02:01,119 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:02:01,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 553 events. 57/553 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2406 event pairs, 10 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 664. Up to 66 conditions per place. [2025-01-09 21:02:01,123 INFO L140 encePairwiseOnDemand]: 178/183 looper letters, 11 selfloop transitions, 3 changer transitions 0/155 dead transitions. [2025-01-09 21:02:01,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 155 transitions, 352 flow [2025-01-09 21:02:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-01-09 21:02:01,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652094717668488 [2025-01-09 21:02:01,124 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 324 flow. Second operand 3 states and 475 transitions. [2025-01-09 21:02:01,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 155 transitions, 352 flow [2025-01-09 21:02:01,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:01,126 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 324 flow [2025-01-09 21:02:01,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=159, PETRI_TRANSITIONS=153} [2025-01-09 21:02:01,127 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -21 predicate places. [2025-01-09 21:02:01,127 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 324 flow [2025-01-09 21:02:01,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:01,128 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] [2025-01-09 21:02:01,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:02:01,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:01,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:01,128 INFO L85 PathProgramCache]: Analyzing trace with hash 316874848, now seen corresponding path program 1 times [2025-01-09 21:02:01,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:01,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963399019] [2025-01-09 21:02:01,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:01,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:01,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:02:01,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:02:01,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:01,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:01,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:01,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963399019] [2025-01-09 21:02:01,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963399019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:01,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:01,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:01,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686440720] [2025-01-09 21:02:01,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:01,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:01,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:01,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:01,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:01,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 183 [2025-01-09 21:02:01,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 153 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:01,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 183 [2025-01-09 21:02:01,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:01,208 INFO L124 PetriNetUnfolderBase]: 65/561 cut-off events. [2025-01-09 21:02:01,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:01,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 561 events. 65/561 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2491 event pairs, 14 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 700. Up to 72 conditions per place. [2025-01-09 21:02:01,212 INFO L140 encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-01-09 21:02:01,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 153 transitions, 352 flow [2025-01-09 21:02:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-01-09 21:02:01,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652094717668488 [2025-01-09 21:02:01,213 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 324 flow. Second operand 3 states and 475 transitions. [2025-01-09 21:02:01,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 153 transitions, 352 flow [2025-01-09 21:02:01,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 153 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:01,215 INFO L231 Difference]: Finished difference. Result has 157 places, 151 transitions, 318 flow [2025-01-09 21:02:01,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=157, PETRI_TRANSITIONS=151} [2025-01-09 21:02:01,216 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -23 predicate places. [2025-01-09 21:02:01,216 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 151 transitions, 318 flow [2025-01-09 21:02:01,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:01,216 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] [2025-01-09 21:02:01,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:02:01,217 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:01,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1570994960, now seen corresponding path program 1 times [2025-01-09 21:02:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:01,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871656892] [2025-01-09 21:02:01,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:01,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:01,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:02:01,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:02:01,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:01,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:01,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:01,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871656892] [2025-01-09 21:02:01,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871656892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:01,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:01,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:01,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251915004] [2025-01-09 21:02:01,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:01,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:01,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:01,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:01,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:01,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:01,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 151 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:01,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:01,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:01,294 INFO L124 PetriNetUnfolderBase]: 37/409 cut-off events. [2025-01-09 21:02:01,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:01,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 409 events. 37/409 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1533 event pairs, 24 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 500. Up to 55 conditions per place. [2025-01-09 21:02:01,297 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2025-01-09 21:02:01,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 152 transitions, 352 flow [2025-01-09 21:02:01,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:02:01,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-01-09 21:02:01,298 INFO L175 Difference]: Start difference. First operand has 157 places, 151 transitions, 318 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:02:01,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 152 transitions, 352 flow [2025-01-09 21:02:01,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 152 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:01,300 INFO L231 Difference]: Finished difference. Result has 156 places, 150 transitions, 316 flow [2025-01-09 21:02:01,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=156, PETRI_TRANSITIONS=150} [2025-01-09 21:02:01,300 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -24 predicate places. [2025-01-09 21:02:01,301 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 150 transitions, 316 flow [2025-01-09 21:02:01,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:01,301 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] [2025-01-09 21:02:01,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:02:01,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:01,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1300269447, now seen corresponding path program 1 times [2025-01-09 21:02:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:01,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869359216] [2025-01-09 21:02:01,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:01,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:01,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:02:01,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:02:01,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:01,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:01,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:01,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869359216] [2025-01-09 21:02:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869359216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:01,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:01,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156044089] [2025-01-09 21:02:01,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:01,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:01,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:01,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:01,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2025-01-09 21:02:01,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 150 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:01,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2025-01-09 21:02:01,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:01,382 INFO L124 PetriNetUnfolderBase]: 61/567 cut-off events. [2025-01-09 21:02:01,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:01,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 567 events. 61/567 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2742 event pairs, 38 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 704. Up to 83 conditions per place. [2025-01-09 21:02:01,385 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 14 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-01-09 21:02:01,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 151 transitions, 350 flow [2025-01-09 21:02:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:02:01,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615664845173042 [2025-01-09 21:02:01,386 INFO L175 Difference]: Start difference. First operand has 156 places, 150 transitions, 316 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:02:01,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 151 transitions, 350 flow [2025-01-09 21:02:01,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 151 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:01,388 INFO L231 Difference]: Finished difference. Result has 155 places, 149 transitions, 314 flow [2025-01-09 21:02:01,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=155, PETRI_TRANSITIONS=149} [2025-01-09 21:02:01,389 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -25 predicate places. [2025-01-09 21:02:01,389 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 149 transitions, 314 flow [2025-01-09 21:02:01,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:01,389 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] [2025-01-09 21:02:01,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:02:01,389 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:01,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1447896771, now seen corresponding path program 1 times [2025-01-09 21:02:01,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:01,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135061861] [2025-01-09 21:02:01,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:01,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:01,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:02:01,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:02:01,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:01,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:01,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:01,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135061861] [2025-01-09 21:02:01,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135061861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:01,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404427015] [2025-01-09 21:02:01,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:01,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:01,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:01,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:01,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:01,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2025-01-09 21:02:01,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 149 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:01,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2025-01-09 21:02:01,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:01,473 INFO L124 PetriNetUnfolderBase]: 65/563 cut-off events. [2025-01-09 21:02:01,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:01,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 563 events. 65/563 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2802 event pairs, 42 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 720. Up to 91 conditions per place. [2025-01-09 21:02:01,476 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-01-09 21:02:01,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 150 transitions, 350 flow [2025-01-09 21:02:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-01-09 21:02:01,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-01-09 21:02:01,478 INFO L175 Difference]: Start difference. First operand has 155 places, 149 transitions, 314 flow. Second operand 3 states and 471 transitions. [2025-01-09 21:02:01,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 150 transitions, 350 flow [2025-01-09 21:02:01,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 150 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:01,479 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 312 flow [2025-01-09 21:02:01,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-01-09 21:02:01,480 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-01-09 21:02:01,480 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 312 flow [2025-01-09 21:02:01,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:01,481 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] [2025-01-09 21:02:01,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:02:01,481 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:01,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:01,481 INFO L85 PathProgramCache]: Analyzing trace with hash 64292726, now seen corresponding path program 1 times [2025-01-09 21:02:01,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:01,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007498079] [2025-01-09 21:02:01,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:01,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:01,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:02:01,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:02:01,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:01,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007498079] [2025-01-09 21:02:01,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007498079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:01,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:01,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410605809] [2025-01-09 21:02:01,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:01,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:01,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:01,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:01,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2025-01-09 21:02:01,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:01,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2025-01-09 21:02:01,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:01,596 INFO L124 PetriNetUnfolderBase]: 51/535 cut-off events. [2025-01-09 21:02:01,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:01,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 535 events. 51/535 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2288 event pairs, 10 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 642. Up to 50 conditions per place. [2025-01-09 21:02:01,599 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 11 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-01-09 21:02:01,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 150 transitions, 342 flow [2025-01-09 21:02:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2025-01-09 21:02:01,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8779599271402551 [2025-01-09 21:02:01,601 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 312 flow. Second operand 3 states and 482 transitions. [2025-01-09 21:02:01,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 150 transitions, 342 flow [2025-01-09 21:02:01,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 150 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:01,602 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 316 flow [2025-01-09 21:02:01,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-01-09 21:02:01,603 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-01-09 21:02:01,603 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 316 flow [2025-01-09 21:02:01,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:01,604 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] [2025-01-09 21:02:01,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:02:01,604 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:01,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:01,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2069992608, now seen corresponding path program 1 times [2025-01-09 21:02:01,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:01,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812717731] [2025-01-09 21:02:01,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:01,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:02:01,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:02:01,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:01,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:01,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:01,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812717731] [2025-01-09 21:02:01,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812717731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:01,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:01,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:01,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369019255] [2025-01-09 21:02:01,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:01,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:01,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:01,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:01,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:01,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2025-01-09 21:02:01,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:01,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2025-01-09 21:02:01,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:01,743 INFO L124 PetriNetUnfolderBase]: 69/551 cut-off events. [2025-01-09 21:02:01,743 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:02:01,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 551 events. 69/551 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2739 event pairs, 46 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 720. Up to 99 conditions per place. [2025-01-09 21:02:01,746 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 15 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2025-01-09 21:02:01,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 149 transitions, 352 flow [2025-01-09 21:02:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-01-09 21:02:01,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2025-01-09 21:02:01,748 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 316 flow. Second operand 3 states and 471 transitions. [2025-01-09 21:02:01,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 149 transitions, 352 flow [2025-01-09 21:02:01,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 149 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:01,751 INFO L231 Difference]: Finished difference. Result has 154 places, 147 transitions, 316 flow [2025-01-09 21:02:01,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2025-01-09 21:02:01,752 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -26 predicate places. [2025-01-09 21:02:01,752 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 316 flow [2025-01-09 21:02:01,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:01,753 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-01-09 21:02:01,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:02:01,753 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:02:01,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1569385207, now seen corresponding path program 1 times [2025-01-09 21:02:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:01,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125026840] [2025-01-09 21:02:01,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:01,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:02:01,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:02:01,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:01,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:01,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125026840] [2025-01-09 21:02:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125026840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:01,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:01,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537790492] [2025-01-09 21:02:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:01,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:01,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:01,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:01,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2025-01-09 21:02:01,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:01,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2025-01-09 21:02:01,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:01,873 INFO L124 PetriNetUnfolderBase]: 57/535 cut-off events. [2025-01-09 21:02:01,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:01,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 535 events. 57/535 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2443 event pairs, 42 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 692. Up to 91 conditions per place. [2025-01-09 21:02:01,875 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 0 selfloop transitions, 0 changer transitions 148/148 dead transitions. [2025-01-09 21:02:01,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 148 transitions, 354 flow [2025-01-09 21:02:01,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-01-09 21:02:01,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8542805100182149 [2025-01-09 21:02:01,877 INFO L175 Difference]: Start difference. First operand has 154 places, 147 transitions, 316 flow. Second operand 3 states and 469 transitions. [2025-01-09 21:02:01,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 148 transitions, 354 flow [2025-01-09 21:02:01,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 148 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:01,879 INFO L231 Difference]: Finished difference. Result has 153 places, 0 transitions, 0 flow [2025-01-09 21:02:01,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=153, PETRI_TRANSITIONS=0} [2025-01-09 21:02:01,879 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -27 predicate places. [2025-01-09 21:02:01,879 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 0 transitions, 0 flow [2025-01-09 21:02:01,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-01-09 21:02:01,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-01-09 21:02:01,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-01-09 21:02:01,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-01-09 21:02:01,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-01-09 21:02:01,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-01-09 21:02:01,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:02:01,884 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:01,888 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:02:01,888 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:02:01,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:02:01 BasicIcfg [2025-01-09 21:02:01,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:02:01,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:02:01,892 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:02:01,892 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:02:01,893 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:01:59" (3/4) ... [2025-01-09 21:02:01,894 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:02:01,896 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2025-01-09 21:02:01,896 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2025-01-09 21:02:01,899 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-01-09 21:02:01,899 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-09 21:02:01,899 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:02:01,899 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:02:01,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:02:01,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:02:01,963 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:02:01,964 INFO L158 Benchmark]: Toolchain (without parser) took 3411.98ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 156.0MB in the beginning and 145.2MB in the end (delta: 10.8MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. [2025-01-09 21:02:01,964 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 226.5MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:01,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.52ms. Allocated memory is still 201.3MB. Free memory was 156.0MB in the beginning and 136.5MB in the end (delta: 19.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:02:01,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.84ms. Allocated memory is still 201.3MB. Free memory was 136.5MB in the beginning and 134.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:02:01,964 INFO L158 Benchmark]: Boogie Preprocessor took 19.19ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 133.5MB in the end (delta: 979.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:02:01,965 INFO L158 Benchmark]: RCFGBuilder took 398.56ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 108.8MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:02:01,965 INFO L158 Benchmark]: TraceAbstraction took 2522.39ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 108.4MB in the beginning and 151.6MB in the end (delta: -43.2MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2025-01-09 21:02:01,965 INFO L158 Benchmark]: Witness Printer took 70.79ms. Allocated memory is still 268.4MB. Free memory was 151.6MB in the beginning and 145.2MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:02:01,966 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.36ms. Allocated memory is still 226.5MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.52ms. Allocated memory is still 201.3MB. Free memory was 156.0MB in the beginning and 136.5MB in the end (delta: 19.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.84ms. Allocated memory is still 201.3MB. Free memory was 136.5MB in the beginning and 134.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.19ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 133.5MB in the end (delta: 979.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 398.56ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 108.8MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2522.39ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 108.4MB in the beginning and 151.6MB in the end (delta: -43.2MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Witness Printer took 70.79ms. Allocated memory is still 268.4MB. Free memory was 151.6MB in the beginning and 145.2MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: 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 5 procedures, 236 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 515 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 51 mSDtfsCounter, 515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 791 NumberOfCodeBlocks, 791 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 774 ConstructedInterpolants, 0 QuantifiedInterpolants, 818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:02:01,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE