./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:50,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:50,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:39:50,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:50,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:50,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:50,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:50,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:50,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:50,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:50,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:50,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:50,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:50,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:50,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:50,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:50,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:50,829 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 -> be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe [2025-02-08 05:39:51,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:51,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:51,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:51,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:51,059 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:51,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2025-02-08 05:39:52,257 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5b1dece2/3f6a91bc54c14313afbd6520c45c3459/FLAG8939c2ecd [2025-02-08 05:39:52,488 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:52,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2025-02-08 05:39:52,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5b1dece2/3f6a91bc54c14313afbd6520c45c3459/FLAG8939c2ecd [2025-02-08 05:39:52,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5b1dece2/3f6a91bc54c14313afbd6520c45c3459 [2025-02-08 05:39:52,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:52,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:52,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:52,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:52,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:52,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d7f19fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52, skipping insertion in model container [2025-02-08 05:39:52,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:39:52,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:52,745 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:39:52,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:39:52,789 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:39:52,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52 WrapperNode [2025-02-08 05:39:52,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:52,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:52,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:39:52,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:39:52,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,842 INFO L138 Inliner]: procedures = 24, calls = 47, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 598 [2025-02-08 05:39:52,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:39:52,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:39:52,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:39:52,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:39:52,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:39:52,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:39:52,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:39:52,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:39:52,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (1/1) ... [2025-02-08 05:39:52,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:52,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:39:52,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:39:52,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:39:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:39:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:39:52,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:39:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:39:52,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:39:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:39:52,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:39:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:39:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:39:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:39:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:39:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:39:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:39:52,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:39:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:39:52,942 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:39:53,065 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:39:53,067 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:39:53,791 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:39:53,791 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:39:54,097 WARN L170 LargeBlockEncoding]: Complex 2:6 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 05:39:54,108 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:39:54,110 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:39:54,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:54 BoogieIcfgContainer [2025-02-08 05:39:54,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:39:54,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:39:54,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:39:54,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:39:54,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:52" (1/3) ... [2025-02-08 05:39:54,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779b701e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:54, skipping insertion in model container [2025-02-08 05:39:54,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:52" (2/3) ... [2025-02-08 05:39:54,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779b701e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:54, skipping insertion in model container [2025-02-08 05:39:54,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:54" (3/3) ... [2025-02-08 05:39:54,120 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2025-02-08 05:39:54,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:39:54,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-ring.wvr.c that has 4 procedures, 439 locations, 1 initial locations, 6 loop locations, and 90 error locations. [2025-02-08 05:39:54,133 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:39:54,274 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:39:54,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 448 places, 461 transitions, 943 flow [2025-02-08 05:39:54,435 INFO L124 PetriNetUnfolderBase]: 23/458 cut-off events. [2025-02-08 05:39:54,438 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:39:54,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 458 events. 23/458 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 788 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 407. Up to 2 conditions per place. [2025-02-08 05:39:54,444 INFO L82 GeneralOperation]: Start removeDead. Operand has 448 places, 461 transitions, 943 flow [2025-02-08 05:39:54,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 429 places, 441 transitions, 900 flow [2025-02-08 05:39:54,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:39:54,473 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;@77ee8ac6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:39:54,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2025-02-08 05:39:54,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:39:54,482 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-02-08 05:39:54,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:39:54,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:54,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:54,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:54,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash -109449368, now seen corresponding path program 1 times [2025-02-08 05:39:54,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:54,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816682543] [2025-02-08 05:39:54,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:54,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:54,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:39:54,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:39:54,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:54,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:54,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816682543] [2025-02-08 05:39:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816682543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:54,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:54,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658668767] [2025-02-08 05:39:54,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:54,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:54,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:54,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:54,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:54,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 461 [2025-02-08 05:39:54,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 441 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:54,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:54,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 461 [2025-02-08 05:39:54,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:54,954 INFO L124 PetriNetUnfolderBase]: 148/865 cut-off events. [2025-02-08 05:39:54,954 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-08 05:39:54,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 865 events. 148/865 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3672 event pairs, 92 based on Foata normal form. 72/840 useless extension candidates. Maximal degree in co-relation 754. Up to 219 conditions per place. [2025-02-08 05:39:54,965 INFO L140 encePairwiseOnDemand]: 380/461 looper letters, 18 selfloop transitions, 2 changer transitions 7/362 dead transitions. [2025-02-08 05:39:54,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 362 transitions, 782 flow [2025-02-08 05:39:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2025-02-08 05:39:54,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8503253796095445 [2025-02-08 05:39:54,982 INFO L175 Difference]: Start difference. First operand has 429 places, 441 transitions, 900 flow. Second operand 3 states and 1176 transitions. [2025-02-08 05:39:54,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 362 transitions, 782 flow [2025-02-08 05:39:54,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 362 transitions, 770 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:39:54,995 INFO L231 Difference]: Finished difference. Result has 362 places, 355 transitions, 720 flow [2025-02-08 05:39:54,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=362, PETRI_TRANSITIONS=355} [2025-02-08 05:39:55,002 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -67 predicate places. [2025-02-08 05:39:55,003 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 355 transitions, 720 flow [2025-02-08 05:39:55,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:55,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:55,004 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] [2025-02-08 05:39:55,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:39:55,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:55,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:55,005 INFO L85 PathProgramCache]: Analyzing trace with hash -480122076, now seen corresponding path program 1 times [2025-02-08 05:39:55,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:55,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021815119] [2025-02-08 05:39:55,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:55,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:39:55,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:39:55,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:55,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021815119] [2025-02-08 05:39:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021815119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542020887] [2025-02-08 05:39:55,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:55,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:55,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:55,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-08 05:39:55,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 355 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:55,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:55,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-08 05:39:55,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:55,226 INFO L124 PetriNetUnfolderBase]: 135/830 cut-off events. [2025-02-08 05:39:55,226 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:55,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 830 events. 135/830 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3577 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1009. Up to 195 conditions per place. [2025-02-08 05:39:55,231 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2025-02-08 05:39:55,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 354 transitions, 756 flow [2025-02-08 05:39:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-08 05:39:55,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-08 05:39:55,233 INFO L175 Difference]: Start difference. First operand has 362 places, 355 transitions, 720 flow. Second operand 3 states and 1100 transitions. [2025-02-08 05:39:55,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 354 transitions, 756 flow [2025-02-08 05:39:55,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 354 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:55,238 INFO L231 Difference]: Finished difference. Result has 354 places, 354 transitions, 718 flow [2025-02-08 05:39:55,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=354, PETRI_TRANSITIONS=354} [2025-02-08 05:39:55,239 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -75 predicate places. [2025-02-08 05:39:55,239 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 354 transitions, 718 flow [2025-02-08 05:39:55,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:55,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:55,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:55,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:39:55,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:55,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash 745367674, now seen corresponding path program 1 times [2025-02-08 05:39:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:55,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857895697] [2025-02-08 05:39:55,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:55,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:39:55,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:39:55,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:55,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:55,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:55,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857895697] [2025-02-08 05:39:55,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857895697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:55,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:55,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:55,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685548254] [2025-02-08 05:39:55,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:55,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:55,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:55,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:55,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:55,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-08 05:39:55,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 354 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:55,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:55,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-08 05:39:55,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:55,463 INFO L124 PetriNetUnfolderBase]: 135/829 cut-off events. [2025-02-08 05:39:55,464 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:55,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 829 events. 135/829 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3565 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1000. Up to 195 conditions per place. [2025-02-08 05:39:55,469 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/353 dead transitions. [2025-02-08 05:39:55,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 353 transitions, 754 flow [2025-02-08 05:39:55,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-08 05:39:55,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-08 05:39:55,471 INFO L175 Difference]: Start difference. First operand has 354 places, 354 transitions, 718 flow. Second operand 3 states and 1100 transitions. [2025-02-08 05:39:55,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 353 transitions, 754 flow [2025-02-08 05:39:55,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 353 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:55,476 INFO L231 Difference]: Finished difference. Result has 353 places, 353 transitions, 716 flow [2025-02-08 05:39:55,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=353, PETRI_TRANSITIONS=353} [2025-02-08 05:39:55,478 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -76 predicate places. [2025-02-08 05:39:55,478 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 353 transitions, 716 flow [2025-02-08 05:39:55,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:55,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:55,479 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] [2025-02-08 05:39:55,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:39:55,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:55,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1239393639, now seen corresponding path program 1 times [2025-02-08 05:39:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:55,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951908543] [2025-02-08 05:39:55,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:55,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:39:55,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:39:55,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:55,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:55,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:55,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951908543] [2025-02-08 05:39:55,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951908543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:55,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:55,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:55,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841053771] [2025-02-08 05:39:55,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:55,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:55,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:55,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:55,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:55,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-08 05:39:55,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 353 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:55,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:55,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-08 05:39:55,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:55,685 INFO L124 PetriNetUnfolderBase]: 135/828 cut-off events. [2025-02-08 05:39:55,685 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:55,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 828 events. 135/828 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3551 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 991. Up to 195 conditions per place. [2025-02-08 05:39:55,691 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2025-02-08 05:39:55,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 352 transitions, 752 flow [2025-02-08 05:39:55,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-08 05:39:55,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-08 05:39:55,695 INFO L175 Difference]: Start difference. First operand has 353 places, 353 transitions, 716 flow. Second operand 3 states and 1100 transitions. [2025-02-08 05:39:55,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 352 transitions, 752 flow [2025-02-08 05:39:55,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 352 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:55,700 INFO L231 Difference]: Finished difference. Result has 352 places, 352 transitions, 714 flow [2025-02-08 05:39:55,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=352, PETRI_TRANSITIONS=352} [2025-02-08 05:39:55,701 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -77 predicate places. [2025-02-08 05:39:55,701 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 352 transitions, 714 flow [2025-02-08 05:39:55,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:55,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:55,702 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-02-08 05:39:55,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:39:55,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:55,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1518517578, now seen corresponding path program 1 times [2025-02-08 05:39:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713976025] [2025-02-08 05:39:55,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:55,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:39:55,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:39:55,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:55,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:55,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:55,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713976025] [2025-02-08 05:39:55,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713976025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:55,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:55,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:55,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598092602] [2025-02-08 05:39:55,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:55,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:55,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:55,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:55,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-08 05:39:55,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 352 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:55,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:55,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-08 05:39:55,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:55,894 INFO L124 PetriNetUnfolderBase]: 135/827 cut-off events. [2025-02-08 05:39:55,895 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:55,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 827 events. 135/827 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3551 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 979. Up to 192 conditions per place. [2025-02-08 05:39:55,899 INFO L140 encePairwiseOnDemand]: 459/461 looper letters, 15 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2025-02-08 05:39:55,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 351 transitions, 744 flow [2025-02-08 05:39:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2025-02-08 05:39:55,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8018799710773681 [2025-02-08 05:39:55,902 INFO L175 Difference]: Start difference. First operand has 352 places, 352 transitions, 714 flow. Second operand 3 states and 1109 transitions. [2025-02-08 05:39:55,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 351 transitions, 744 flow [2025-02-08 05:39:55,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 351 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:55,906 INFO L231 Difference]: Finished difference. Result has 351 places, 351 transitions, 710 flow [2025-02-08 05:39:55,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=351, PETRI_TRANSITIONS=351} [2025-02-08 05:39:55,907 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -78 predicate places. [2025-02-08 05:39:55,907 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 351 transitions, 710 flow [2025-02-08 05:39:55,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:55,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:55,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:55,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:39:55,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:55,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash 237917189, now seen corresponding path program 1 times [2025-02-08 05:39:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:55,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623808062] [2025-02-08 05:39:55,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:55,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:39:55,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:39:55,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:55,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:56,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:56,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623808062] [2025-02-08 05:39:56,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623808062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:56,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:56,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:39:56,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471942460] [2025-02-08 05:39:56,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:56,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:39:56,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:56,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:39:56,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:39:56,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 461 [2025-02-08 05:39:56,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 351 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 327.5) internal successors, (1965), 6 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:56,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:56,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 461 [2025-02-08 05:39:56,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:56,753 INFO L124 PetriNetUnfolderBase]: 135/824 cut-off events. [2025-02-08 05:39:56,753 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:56,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 824 events. 135/824 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3536 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1012. Up to 215 conditions per place. [2025-02-08 05:39:56,756 INFO L140 encePairwiseOnDemand]: 443/461 looper letters, 37 selfloop transitions, 15 changer transitions 0/348 dead transitions. [2025-02-08 05:39:56,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 348 transitions, 808 flow [2025-02-08 05:39:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:39:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:39:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2011 transitions. [2025-02-08 05:39:56,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7270426608821403 [2025-02-08 05:39:56,760 INFO L175 Difference]: Start difference. First operand has 351 places, 351 transitions, 710 flow. Second operand 6 states and 2011 transitions. [2025-02-08 05:39:56,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 348 transitions, 808 flow [2025-02-08 05:39:56,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 348 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:56,764 INFO L231 Difference]: Finished difference. Result has 352 places, 348 transitions, 733 flow [2025-02-08 05:39:56,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=733, PETRI_PLACES=352, PETRI_TRANSITIONS=348} [2025-02-08 05:39:56,766 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -77 predicate places. [2025-02-08 05:39:56,766 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 348 transitions, 733 flow [2025-02-08 05:39:56,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 327.5) internal successors, (1965), 6 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:56,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:56,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:56,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:39:56,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:56,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1540327941, now seen corresponding path program 1 times [2025-02-08 05:39:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:56,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340919209] [2025-02-08 05:39:56,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:56,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:39:56,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:39:56,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:56,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:56,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:56,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340919209] [2025-02-08 05:39:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340919209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:56,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:56,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:56,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886194932] [2025-02-08 05:39:56,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:56,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:56,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:56,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:56,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:56,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-08 05:39:56,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 348 transitions, 733 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:56,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:56,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-08 05:39:56,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:56,958 INFO L124 PetriNetUnfolderBase]: 135/823 cut-off events. [2025-02-08 05:39:56,959 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:56,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 823 events. 135/823 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3510 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1006. Up to 194 conditions per place. [2025-02-08 05:39:56,962 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 16 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2025-02-08 05:39:56,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 347 transitions, 767 flow [2025-02-08 05:39:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-08 05:39:56,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-08 05:39:56,965 INFO L175 Difference]: Start difference. First operand has 352 places, 348 transitions, 733 flow. Second operand 3 states and 1102 transitions. [2025-02-08 05:39:56,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 347 transitions, 767 flow [2025-02-08 05:39:56,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 347 transitions, 737 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:39:56,969 INFO L231 Difference]: Finished difference. Result has 348 places, 347 transitions, 705 flow [2025-02-08 05:39:56,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=348, PETRI_TRANSITIONS=347} [2025-02-08 05:39:56,970 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -81 predicate places. [2025-02-08 05:39:56,970 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 347 transitions, 705 flow [2025-02-08 05:39:56,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:56,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:56,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:56,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:39:56,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:56,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:56,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1926270495, now seen corresponding path program 1 times [2025-02-08 05:39:56,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713337322] [2025-02-08 05:39:56,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:56,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:56,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:39:56,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:39:56,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:56,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713337322] [2025-02-08 05:39:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713337322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:57,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:57,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:57,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723648113] [2025-02-08 05:39:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:57,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:57,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:57,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:57,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-08 05:39:57,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 347 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:57,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-08 05:39:57,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:57,120 INFO L124 PetriNetUnfolderBase]: 135/822 cut-off events. [2025-02-08 05:39:57,121 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:57,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 822 events. 135/822 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3505 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 975. Up to 192 conditions per place. [2025-02-08 05:39:57,125 INFO L140 encePairwiseOnDemand]: 459/461 looper letters, 15 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2025-02-08 05:39:57,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 346 transitions, 735 flow [2025-02-08 05:39:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2025-02-08 05:39:57,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8018799710773681 [2025-02-08 05:39:57,127 INFO L175 Difference]: Start difference. First operand has 348 places, 347 transitions, 705 flow. Second operand 3 states and 1109 transitions. [2025-02-08 05:39:57,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 346 transitions, 735 flow [2025-02-08 05:39:57,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 346 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:57,132 INFO L231 Difference]: Finished difference. Result has 347 places, 346 transitions, 701 flow [2025-02-08 05:39:57,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=347, PETRI_TRANSITIONS=346} [2025-02-08 05:39:57,134 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -82 predicate places. [2025-02-08 05:39:57,135 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 346 transitions, 701 flow [2025-02-08 05:39:57,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:57,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:57,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:39:57,137 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1720782524, now seen corresponding path program 1 times [2025-02-08 05:39:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:57,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434595222] [2025-02-08 05:39:57,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:57,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:57,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:39:57,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:39:57,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:57,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:57,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434595222] [2025-02-08 05:39:57,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434595222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:57,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:57,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403509607] [2025-02-08 05:39:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:57,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:57,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:57,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:57,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:57,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-08 05:39:57,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 346 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:57,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-08 05:39:57,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:57,336 INFO L124 PetriNetUnfolderBase]: 135/821 cut-off events. [2025-02-08 05:39:57,336 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:57,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 821 events. 135/821 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3503 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 975. Up to 194 conditions per place. [2025-02-08 05:39:57,340 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 16 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2025-02-08 05:39:57,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 345 transitions, 735 flow [2025-02-08 05:39:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-08 05:39:57,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-08 05:39:57,343 INFO L175 Difference]: Start difference. First operand has 347 places, 346 transitions, 701 flow. Second operand 3 states and 1102 transitions. [2025-02-08 05:39:57,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 345 transitions, 735 flow [2025-02-08 05:39:57,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 345 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:57,348 INFO L231 Difference]: Finished difference. Result has 347 places, 345 transitions, 702 flow [2025-02-08 05:39:57,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=347, PETRI_TRANSITIONS=345} [2025-02-08 05:39:57,349 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -82 predicate places. [2025-02-08 05:39:57,349 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 345 transitions, 702 flow [2025-02-08 05:39:57,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:57,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:57,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:39:57,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2001503005, now seen corresponding path program 1 times [2025-02-08 05:39:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:57,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623702792] [2025-02-08 05:39:57,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:57,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:57,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-08 05:39:57,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-08 05:39:57,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:57,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:57,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:57,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623702792] [2025-02-08 05:39:57,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623702792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:57,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:57,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:57,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831593350] [2025-02-08 05:39:57,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:57,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:57,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:57,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:57,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:57,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-08 05:39:57,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 345 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:57,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-08 05:39:57,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:57,519 INFO L124 PetriNetUnfolderBase]: 135/820 cut-off events. [2025-02-08 05:39:57,519 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:57,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 820 events. 135/820 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3513 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 974. Up to 192 conditions per place. [2025-02-08 05:39:57,524 INFO L140 encePairwiseOnDemand]: 459/461 looper letters, 15 selfloop transitions, 1 changer transitions 0/344 dead transitions. [2025-02-08 05:39:57,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 344 transitions, 732 flow [2025-02-08 05:39:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2025-02-08 05:39:57,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8018799710773681 [2025-02-08 05:39:57,527 INFO L175 Difference]: Start difference. First operand has 347 places, 345 transitions, 702 flow. Second operand 3 states and 1109 transitions. [2025-02-08 05:39:57,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 344 transitions, 732 flow [2025-02-08 05:39:57,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 344 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:57,531 INFO L231 Difference]: Finished difference. Result has 346 places, 344 transitions, 698 flow [2025-02-08 05:39:57,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=346, PETRI_TRANSITIONS=344} [2025-02-08 05:39:57,533 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -83 predicate places. [2025-02-08 05:39:57,534 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 344 transitions, 698 flow [2025-02-08 05:39:57,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:57,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:57,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:39:57,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:57,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:57,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1455325740, now seen corresponding path program 1 times [2025-02-08 05:39:57,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:57,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608565739] [2025-02-08 05:39:57,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:57,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:39:57,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:39:57,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:57,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:57,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608565739] [2025-02-08 05:39:57,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608565739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:57,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:57,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:57,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546187175] [2025-02-08 05:39:57,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:57,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:57,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:57,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:57,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:57,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-08 05:39:57,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 344 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:57,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-08 05:39:57,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:57,703 INFO L124 PetriNetUnfolderBase]: 135/819 cut-off events. [2025-02-08 05:39:57,703 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:57,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 819 events. 135/819 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3509 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 974. Up to 194 conditions per place. [2025-02-08 05:39:57,707 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 16 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-02-08 05:39:57,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 343 transitions, 732 flow [2025-02-08 05:39:57,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-08 05:39:57,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-08 05:39:57,710 INFO L175 Difference]: Start difference. First operand has 346 places, 344 transitions, 698 flow. Second operand 3 states and 1102 transitions. [2025-02-08 05:39:57,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 343 transitions, 732 flow [2025-02-08 05:39:57,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 343 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:57,714 INFO L231 Difference]: Finished difference. Result has 346 places, 343 transitions, 699 flow [2025-02-08 05:39:57,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=346, PETRI_TRANSITIONS=343} [2025-02-08 05:39:57,715 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -83 predicate places. [2025-02-08 05:39:57,715 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 343 transitions, 699 flow [2025-02-08 05:39:57,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:57,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:57,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:39:57,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:57,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1400366948, now seen corresponding path program 1 times [2025-02-08 05:39:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67286342] [2025-02-08 05:39:57,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:57,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 05:39:57,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 05:39:57,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:57,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:57,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67286342] [2025-02-08 05:39:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67286342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:57,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:57,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:57,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685342661] [2025-02-08 05:39:57,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:57,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:57,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:57,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:57,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:57,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-08 05:39:57,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 343 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:57,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-08 05:39:57,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:57,875 INFO L124 PetriNetUnfolderBase]: 135/818 cut-off events. [2025-02-08 05:39:57,876 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:57,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 818 events. 135/818 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3494 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 976. Up to 195 conditions per place. [2025-02-08 05:39:57,880 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-02-08 05:39:57,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 342 transitions, 735 flow [2025-02-08 05:39:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-08 05:39:57,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-08 05:39:57,882 INFO L175 Difference]: Start difference. First operand has 346 places, 343 transitions, 699 flow. Second operand 3 states and 1100 transitions. [2025-02-08 05:39:57,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 342 transitions, 735 flow [2025-02-08 05:39:57,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 342 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:57,886 INFO L231 Difference]: Finished difference. Result has 345 places, 342 transitions, 697 flow [2025-02-08 05:39:57,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=345, PETRI_TRANSITIONS=342} [2025-02-08 05:39:57,887 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -84 predicate places. [2025-02-08 05:39:57,887 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 342 transitions, 697 flow [2025-02-08 05:39:57,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:57,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:57,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:39:57,889 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:57,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:57,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2087240677, now seen corresponding path program 1 times [2025-02-08 05:39:57,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:57,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438663387] [2025-02-08 05:39:57,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:57,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:57,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 05:39:57,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 05:39:57,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:57,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438663387] [2025-02-08 05:39:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438663387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425133435] [2025-02-08 05:39:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:57,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:57,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:57,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:57,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-08 05:39:57,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 342 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:57,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:57,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-08 05:39:57,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:58,064 INFO L124 PetriNetUnfolderBase]: 135/817 cut-off events. [2025-02-08 05:39:58,065 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:58,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 817 events. 135/817 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3491 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 975. Up to 195 conditions per place. [2025-02-08 05:39:58,069 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-02-08 05:39:58,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 341 transitions, 733 flow [2025-02-08 05:39:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-08 05:39:58,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-08 05:39:58,071 INFO L175 Difference]: Start difference. First operand has 345 places, 342 transitions, 697 flow. Second operand 3 states and 1100 transitions. [2025-02-08 05:39:58,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 341 transitions, 733 flow [2025-02-08 05:39:58,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 341 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:58,075 INFO L231 Difference]: Finished difference. Result has 344 places, 341 transitions, 695 flow [2025-02-08 05:39:58,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=344, PETRI_TRANSITIONS=341} [2025-02-08 05:39:58,076 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -85 predicate places. [2025-02-08 05:39:58,076 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 341 transitions, 695 flow [2025-02-08 05:39:58,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:58,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:58,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:39:58,078 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:58,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1436798924, now seen corresponding path program 1 times [2025-02-08 05:39:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:58,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860000703] [2025-02-08 05:39:58,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:58,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-08 05:39:58,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-08 05:39:58,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:58,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:58,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860000703] [2025-02-08 05:39:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860000703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:58,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:58,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678506852] [2025-02-08 05:39:58,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:58,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:58,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:58,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:58,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:58,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-08 05:39:58,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 341 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:58,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-08 05:39:58,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:58,248 INFO L124 PetriNetUnfolderBase]: 135/816 cut-off events. [2025-02-08 05:39:58,248 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:39:58,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 816 events. 135/816 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3497 event pairs, 74 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 974. Up to 195 conditions per place. [2025-02-08 05:39:58,254 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-02-08 05:39:58,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 340 transitions, 731 flow [2025-02-08 05:39:58,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-08 05:39:58,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-08 05:39:58,257 INFO L175 Difference]: Start difference. First operand has 344 places, 341 transitions, 695 flow. Second operand 3 states and 1100 transitions. [2025-02-08 05:39:58,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 340 transitions, 731 flow [2025-02-08 05:39:58,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 340 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:58,262 INFO L231 Difference]: Finished difference. Result has 343 places, 340 transitions, 693 flow [2025-02-08 05:39:58,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=343, PETRI_TRANSITIONS=340} [2025-02-08 05:39:58,264 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-08 05:39:58,264 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 693 flow [2025-02-08 05:39:58,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:58,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:58,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:39:58,265 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:58,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash -972662391, now seen corresponding path program 1 times [2025-02-08 05:39:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:58,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520387729] [2025-02-08 05:39:58,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:58,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:39:58,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:39:58,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:58,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520387729] [2025-02-08 05:39:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520387729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:58,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932464385] [2025-02-08 05:39:58,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:58,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:58,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:58,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:58,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:58,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-08 05:39:58,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:58,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-08 05:39:58,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:58,433 INFO L124 PetriNetUnfolderBase]: 127/717 cut-off events. [2025-02-08 05:39:58,433 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:39:58,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 717 events. 127/717 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2659 event pairs, 14 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 868. Up to 141 conditions per place. [2025-02-08 05:39:58,437 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 22 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2025-02-08 05:39:58,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 347 transitions, 757 flow [2025-02-08 05:39:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2025-02-08 05:39:58,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8076644974692697 [2025-02-08 05:39:58,439 INFO L175 Difference]: Start difference. First operand has 343 places, 340 transitions, 693 flow. Second operand 3 states and 1117 transitions. [2025-02-08 05:39:58,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 347 transitions, 757 flow [2025-02-08 05:39:58,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 347 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:58,445 INFO L231 Difference]: Finished difference. Result has 343 places, 340 transitions, 697 flow [2025-02-08 05:39:58,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=340} [2025-02-08 05:39:58,446 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-08 05:39:58,447 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 697 flow [2025-02-08 05:39:58,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:58,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:58,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:39:58,448 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:58,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1134681954, now seen corresponding path program 1 times [2025-02-08 05:39:58,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:58,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998638188] [2025-02-08 05:39:58,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:58,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:58,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 05:39:58,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 05:39:58,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:58,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998638188] [2025-02-08 05:39:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998638188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502444471] [2025-02-08 05:39:58,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:58,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:58,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:58,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:58,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-08 05:39:58,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:58,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-08 05:39:58,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:58,633 INFO L124 PetriNetUnfolderBase]: 136/821 cut-off events. [2025-02-08 05:39:58,633 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-08 05:39:58,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 821 events. 136/821 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3580 event pairs, 74 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 1038. Up to 198 conditions per place. [2025-02-08 05:39:58,636 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-02-08 05:39:58,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 339 transitions, 733 flow [2025-02-08 05:39:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-08 05:39:58,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-08 05:39:58,639 INFO L175 Difference]: Start difference. First operand has 343 places, 340 transitions, 697 flow. Second operand 3 states and 1102 transitions. [2025-02-08 05:39:58,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 339 transitions, 733 flow [2025-02-08 05:39:58,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 339 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:58,644 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 697 flow [2025-02-08 05:39:58,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2025-02-08 05:39:58,645 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-08 05:39:58,645 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 697 flow [2025-02-08 05:39:58,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:58,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:58,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:39:58,647 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:58,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:58,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1918993722, now seen corresponding path program 1 times [2025-02-08 05:39:58,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:58,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682002344] [2025-02-08 05:39:58,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:58,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:58,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 05:39:58,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 05:39:58,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:58,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:58,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:58,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682002344] [2025-02-08 05:39:58,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682002344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:58,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:58,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948729023] [2025-02-08 05:39:58,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:58,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:58,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:58,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:58,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:58,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-08 05:39:58,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:58,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-08 05:39:58,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:58,877 INFO L124 PetriNetUnfolderBase]: 137/782 cut-off events. [2025-02-08 05:39:58,877 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-08 05:39:58,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 782 events. 137/782 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3191 event pairs, 28 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 985. Up to 119 conditions per place. [2025-02-08 05:39:58,882 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 24 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2025-02-08 05:39:58,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 347 transitions, 771 flow [2025-02-08 05:39:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2025-02-08 05:39:58,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8076644974692697 [2025-02-08 05:39:58,884 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 697 flow. Second operand 3 states and 1117 transitions. [2025-02-08 05:39:58,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 347 transitions, 771 flow [2025-02-08 05:39:58,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 347 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:58,890 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 701 flow [2025-02-08 05:39:58,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2025-02-08 05:39:58,891 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-08 05:39:58,891 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 701 flow [2025-02-08 05:39:58,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:58,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:39:58,892 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:58,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1314848542, now seen corresponding path program 1 times [2025-02-08 05:39:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876885090] [2025-02-08 05:39:58,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:58,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:58,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 05:39:58,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 05:39:58,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:58,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:58,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876885090] [2025-02-08 05:39:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876885090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111123863] [2025-02-08 05:39:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:58,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:58,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:58,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:58,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-08 05:39:58,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:58,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:58,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-08 05:39:58,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:59,057 INFO L124 PetriNetUnfolderBase]: 137/826 cut-off events. [2025-02-08 05:39:59,058 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-08 05:39:59,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 826 events. 137/826 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3659 event pairs, 74 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 1077. Up to 202 conditions per place. [2025-02-08 05:39:59,063 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 18 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2025-02-08 05:39:59,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 338 transitions, 739 flow [2025-02-08 05:39:59,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-08 05:39:59,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-08 05:39:59,066 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 701 flow. Second operand 3 states and 1102 transitions. [2025-02-08 05:39:59,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 338 transitions, 739 flow [2025-02-08 05:39:59,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 338 transitions, 737 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:59,070 INFO L231 Difference]: Finished difference. Result has 343 places, 338 transitions, 701 flow [2025-02-08 05:39:59,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=343, PETRI_TRANSITIONS=338} [2025-02-08 05:39:59,071 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-08 05:39:59,071 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 338 transitions, 701 flow [2025-02-08 05:39:59,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:59,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:39:59,072 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:59,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash -549862055, now seen corresponding path program 1 times [2025-02-08 05:39:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:59,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870735924] [2025-02-08 05:39:59,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:59,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:59,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 05:39:59,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 05:39:59,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:59,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:59,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:59,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870735924] [2025-02-08 05:39:59,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870735924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:59,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:59,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688180921] [2025-02-08 05:39:59,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:59,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:59,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:59,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:59,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:59,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-08 05:39:59,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 338 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:59,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-08 05:39:59,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:59,290 INFO L124 PetriNetUnfolderBase]: 196/990 cut-off events. [2025-02-08 05:39:59,291 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-02-08 05:39:59,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 990 events. 196/990 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4763 event pairs, 56 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1375. Up to 163 conditions per place. [2025-02-08 05:39:59,295 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 30 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2025-02-08 05:39:59,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 351 transitions, 804 flow [2025-02-08 05:39:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1121 transitions. [2025-02-08 05:39:59,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8105567606652205 [2025-02-08 05:39:59,297 INFO L175 Difference]: Start difference. First operand has 343 places, 338 transitions, 701 flow. Second operand 3 states and 1121 transitions. [2025-02-08 05:39:59,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 351 transitions, 804 flow [2025-02-08 05:39:59,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 351 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:59,301 INFO L231 Difference]: Finished difference. Result has 343 places, 338 transitions, 705 flow [2025-02-08 05:39:59,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=343, PETRI_TRANSITIONS=338} [2025-02-08 05:39:59,302 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-08 05:39:59,302 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 338 transitions, 705 flow [2025-02-08 05:39:59,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:59,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:59,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:39:59,303 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:59,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:59,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2046586980, now seen corresponding path program 1 times [2025-02-08 05:39:59,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:59,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944267925] [2025-02-08 05:39:59,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:59,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 05:39:59,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 05:39:59,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:59,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:59,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944267925] [2025-02-08 05:39:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944267925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:59,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217701368] [2025-02-08 05:39:59,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:59,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:59,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:59,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-08 05:39:59,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 338 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:59,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-08 05:39:59,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:59,495 INFO L124 PetriNetUnfolderBase]: 196/1004 cut-off events. [2025-02-08 05:39:59,495 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-02-08 05:39:59,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1004 events. 196/1004 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4836 event pairs, 124 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1428. Up to 301 conditions per place. [2025-02-08 05:39:59,499 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 19 selfloop transitions, 2 changer transitions 0/337 dead transitions. [2025-02-08 05:39:59,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 337 transitions, 745 flow [2025-02-08 05:39:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-08 05:39:59,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-08 05:39:59,501 INFO L175 Difference]: Start difference. First operand has 343 places, 338 transitions, 705 flow. Second operand 3 states and 1102 transitions. [2025-02-08 05:39:59,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 337 transitions, 745 flow [2025-02-08 05:39:59,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 337 transitions, 743 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:39:59,505 INFO L231 Difference]: Finished difference. Result has 343 places, 337 transitions, 705 flow [2025-02-08 05:39:59,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=343, PETRI_TRANSITIONS=337} [2025-02-08 05:39:59,506 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-08 05:39:59,506 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 337 transitions, 705 flow [2025-02-08 05:39:59,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:59,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:59,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:39:59,507 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:59,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:59,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1481562263, now seen corresponding path program 1 times [2025-02-08 05:39:59,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:59,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557900489] [2025-02-08 05:39:59,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:59,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:59,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 05:39:59,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 05:39:59,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:59,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:59,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:59,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557900489] [2025-02-08 05:39:59,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557900489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:59,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:59,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157013457] [2025-02-08 05:39:59,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:59,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:59,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:59,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:59,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:59,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-08 05:39:59,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 337 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:59,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-08 05:39:59,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:59,728 INFO L124 PetriNetUnfolderBase]: 296/1261 cut-off events. [2025-02-08 05:39:59,728 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-02-08 05:39:59,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 1261 events. 296/1261 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6747 event pairs, 196 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 1896. Up to 451 conditions per place. [2025-02-08 05:39:59,738 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 20 selfloop transitions, 1 changer transitions 0/335 dead transitions. [2025-02-08 05:39:59,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 335 transitions, 743 flow [2025-02-08 05:39:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:39:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:39:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-02-08 05:39:59,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975415762834418 [2025-02-08 05:39:59,741 INFO L175 Difference]: Start difference. First operand has 343 places, 337 transitions, 705 flow. Second operand 3 states and 1103 transitions. [2025-02-08 05:39:59,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 335 transitions, 743 flow [2025-02-08 05:39:59,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 335 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:39:59,747 INFO L231 Difference]: Finished difference. Result has 341 places, 335 transitions, 699 flow [2025-02-08 05:39:59,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=341, PETRI_TRANSITIONS=335} [2025-02-08 05:39:59,748 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -88 predicate places. [2025-02-08 05:39:59,748 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 335 transitions, 699 flow [2025-02-08 05:39:59,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:39:59,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:39:59,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:39:59,748 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err29ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:39:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:39:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2110258095, now seen corresponding path program 1 times [2025-02-08 05:39:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:39:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506985956] [2025-02-08 05:39:59,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:39:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:39:59,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-08 05:39:59,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-08 05:39:59,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:39:59,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:39:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:39:59,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:39:59,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506985956] [2025-02-08 05:39:59,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506985956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:39:59,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:39:59,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:39:59,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254359924] [2025-02-08 05:39:59,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:39:59,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:39:59,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:39:59,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:39:59,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:39:59,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-08 05:39:59,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 335 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:39:59,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:39:59,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-08 05:39:59,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:39:59,994 INFO L124 PetriNetUnfolderBase]: 346/1327 cut-off events. [2025-02-08 05:39:59,994 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-02-08 05:39:59,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 1327 events. 346/1327 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7178 event pairs, 196 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 2073. Up to 452 conditions per place. [2025-02-08 05:40:00,000 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 29 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-02-08 05:40:00,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 342 transitions, 785 flow [2025-02-08 05:40:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2025-02-08 05:40:00,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8004338394793926 [2025-02-08 05:40:00,002 INFO L175 Difference]: Start difference. First operand has 341 places, 335 transitions, 699 flow. Second operand 3 states and 1107 transitions. [2025-02-08 05:40:00,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 342 transitions, 785 flow [2025-02-08 05:40:00,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 342 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:00,009 INFO L231 Difference]: Finished difference. Result has 341 places, 334 transitions, 700 flow [2025-02-08 05:40:00,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=341, PETRI_TRANSITIONS=334} [2025-02-08 05:40:00,009 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -88 predicate places. [2025-02-08 05:40:00,010 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 334 transitions, 700 flow [2025-02-08 05:40:00,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:00,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:00,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:40:00,012 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:40:00,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:00,013 INFO L85 PathProgramCache]: Analyzing trace with hash -198023056, now seen corresponding path program 1 times [2025-02-08 05:40:00,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:00,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520613504] [2025-02-08 05:40:00,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:00,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:00,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-08 05:40:00,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-08 05:40:00,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:00,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:00,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:00,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520613504] [2025-02-08 05:40:00,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520613504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:00,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:00,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:00,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986564169] [2025-02-08 05:40:00,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:00,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:00,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:00,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:00,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:00,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-08 05:40:00,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 334 transitions, 700 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:00,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-08 05:40:00,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:00,315 INFO L124 PetriNetUnfolderBase]: 296/1175 cut-off events. [2025-02-08 05:40:00,315 INFO L125 PetriNetUnfolderBase]: For 216/216 co-relation queries the response was YES. [2025-02-08 05:40:00,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1175 events. 296/1175 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5895 event pairs, 160 based on Foata normal form. 2/1087 useless extension candidates. Maximal degree in co-relation 1823. Up to 374 conditions per place. [2025-02-08 05:40:00,320 INFO L140 encePairwiseOnDemand]: 456/461 looper letters, 22 selfloop transitions, 2 changer transitions 7/340 dead transitions. [2025-02-08 05:40:00,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 340 transitions, 780 flow [2025-02-08 05:40:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2025-02-08 05:40:00,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7997107736804049 [2025-02-08 05:40:00,323 INFO L175 Difference]: Start difference. First operand has 341 places, 334 transitions, 700 flow. Second operand 3 states and 1106 transitions. [2025-02-08 05:40:00,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 340 transitions, 780 flow [2025-02-08 05:40:00,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 340 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:00,327 INFO L231 Difference]: Finished difference. Result has 339 places, 325 transitions, 679 flow [2025-02-08 05:40:00,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=339, PETRI_TRANSITIONS=325} [2025-02-08 05:40:00,328 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -90 predicate places. [2025-02-08 05:40:00,328 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 325 transitions, 679 flow [2025-02-08 05:40:00,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:00,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:00,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:40:00,329 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-08 05:40:00,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1309158898, now seen corresponding path program 1 times [2025-02-08 05:40:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:00,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933629723] [2025-02-08 05:40:00,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:00,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:00,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-08 05:40:00,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-08 05:40:00,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:00,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:00,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933629723] [2025-02-08 05:40:00,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933629723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:00,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102645201] [2025-02-08 05:40:00,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:00,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:00,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:00,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:00,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-08 05:40:00,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 325 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:00,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-08 05:40:00,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:00,566 INFO L124 PetriNetUnfolderBase]: 254/990 cut-off events. [2025-02-08 05:40:00,566 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 05:40:00,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 990 events. 254/990 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4400 event pairs, 132 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1552. Up to 306 conditions per place. [2025-02-08 05:40:00,569 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 0 selfloop transitions, 0 changer transitions 332/332 dead transitions. [2025-02-08 05:40:00,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 332 transitions, 755 flow [2025-02-08 05:40:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-08 05:40:00,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-08 05:40:00,572 INFO L175 Difference]: Start difference. First operand has 339 places, 325 transitions, 679 flow. Second operand 3 states and 1102 transitions. [2025-02-08 05:40:00,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 332 transitions, 755 flow [2025-02-08 05:40:00,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 332 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:00,575 INFO L231 Difference]: Finished difference. Result has 331 places, 0 transitions, 0 flow [2025-02-08 05:40:00,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=331, PETRI_TRANSITIONS=0} [2025-02-08 05:40:00,576 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -98 predicate places. [2025-02-08 05:40:00,576 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 0 transitions, 0 flow [2025-02-08 05:40:00,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:00,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (158 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (157 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (156 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (155 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (154 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (153 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (152 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (151 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (150 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (149 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (148 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (147 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (146 of 159 remaining) [2025-02-08 05:40:00,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (145 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (144 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (143 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (142 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (141 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (140 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (139 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (138 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (137 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (136 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (135 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (134 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (133 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (132 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (131 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (130 of 159 remaining) [2025-02-08 05:40:00,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (129 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (128 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (127 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (126 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (125 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (124 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (123 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (122 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (121 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (120 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (119 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (118 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (117 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (116 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (115 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (114 of 159 remaining) [2025-02-08 05:40:00,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (113 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (112 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (111 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (110 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (109 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (108 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (107 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (106 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (105 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (104 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (103 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (102 of 159 remaining) [2025-02-08 05:40:00,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (101 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (100 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (99 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (98 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (97 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (96 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (95 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (94 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (93 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (92 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (91 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (90 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (89 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (88 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (87 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (86 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (85 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (84 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (83 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (82 of 159 remaining) [2025-02-08 05:40:00,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (81 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (80 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (79 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (77 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (76 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (75 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (73 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (72 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (71 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (70 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (69 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (66 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (65 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (64 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (62 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (61 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (60 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (59 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (58 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (57 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (55 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (54 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (53 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (52 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (51 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (50 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (49 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (48 of 159 remaining) [2025-02-08 05:40:00,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (47 of 159 remaining) [2025-02-08 05:40:00,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (46 of 159 remaining) [2025-02-08 05:40:00,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (45 of 159 remaining) [2025-02-08 05:40:00,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (44 of 159 remaining) [2025-02-08 05:40:00,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (43 of 159 remaining) [2025-02-08 05:40:00,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (42 of 159 remaining) [2025-02-08 05:40:00,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (41 of 159 remaining) [2025-02-08 05:40:00,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (40 of 159 remaining) [2025-02-08 05:40:00,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 159 remaining) [2025-02-08 05:40:00,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (38 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (37 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (36 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (35 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (34 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (32 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (31 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (30 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (29 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (27 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (26 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (24 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (23 of 159 remaining) [2025-02-08 05:40:00,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (22 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (18 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 159 remaining) [2025-02-08 05:40:00,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 159 remaining) [2025-02-08 05:40:00,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 159 remaining) [2025-02-08 05:40:00,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 159 remaining) [2025-02-08 05:40:00,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 159 remaining) [2025-02-08 05:40:00,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 159 remaining) [2025-02-08 05:40:00,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 159 remaining) [2025-02-08 05:40:00,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 159 remaining) [2025-02-08 05:40:00,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:40:00,588 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:00,593 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:00,593 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:00,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:00 BasicIcfg [2025-02-08 05:40:00,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:00,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:00,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:00,598 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:00,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:54" (3/4) ... [2025-02-08 05:40:00,599 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:00,601 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:00,601 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:00,601 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:00,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-08 05:40:00,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:00,611 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:40:00,611 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:00,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:00,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:00,685 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:00,686 INFO L158 Benchmark]: Toolchain (without parser) took 8162.30ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 130.6MB in the beginning and 249.8MB in the end (delta: -119.2MB). Peak memory consumption was 211.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:00,686 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:00,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.83ms. Allocated memory is still 167.8MB. Free memory was 130.6MB in the beginning and 116.4MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:00,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.46ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 112.7MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:00,688 INFO L158 Benchmark]: Boogie Preprocessor took 49.00ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 109.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:00,688 INFO L158 Benchmark]: IcfgBuilder took 1215.84ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 60.8MB in the end (delta: 49.0MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:00,688 INFO L158 Benchmark]: TraceAbstraction took 6484.40ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 59.9MB in the beginning and 258.2MB in the end (delta: -198.3MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:00,688 INFO L158 Benchmark]: Witness Printer took 87.30ms. Allocated memory is still 503.3MB. Free memory was 258.2MB in the beginning and 249.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:00,689 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.83ms. Allocated memory is still 167.8MB. Free memory was 130.6MB in the beginning and 116.4MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.46ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 112.7MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.00ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 109.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1215.84ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 60.8MB in the end (delta: 49.0MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6484.40ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 59.9MB in the beginning and 258.2MB in the end (delta: -198.3MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. * Witness Printer took 87.30ms. Allocated memory is still 503.3MB. Free memory was 258.2MB in the beginning and 249.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: 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 7 procedures, 557 locations, 159 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: 6.3s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1095 IncrementalHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 77 mSDtfsCounter, 1095 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3487 NumberOfCodeBlocks, 3487 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3463 ConstructedInterpolants, 0 QuantifiedInterpolants, 3624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 90 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:00,705 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